{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:05:47Z","timestamp":1649066747008},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1980,6,1]],"date-time":"1980-06-01T00:00:00Z","timestamp":328665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12099,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1980,6]]},"DOI":"10.1016\/0304-3975(80)90042-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"123-143","source":"Crossref","is-referenced-by-count":2,"title":["The reachability problem for Petri nets and decision problems for Skolem arithmetic"],"prefix":"10.1016","volume":"11","author":[{"given":"Egon","family":"B\u00f6rger","sequence":"first","affiliation":[]},{"given":"Hans","family":"Kleine B\u00fcning","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90042-0_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0049-237X(08)70839-5","article-title":"On the decision problem for formulas in which all disjunctions are binary","author":"Aanderaa","year":"1971","journal-title":"Proc. 2nd Scand. Log. Symp."},{"key":"10.1016\/0304-3975(80)90042-0_BIB2","series-title":"Dissertation","article-title":"Reduktionstypen in Krom-und Hornformeln","author":"B\u00f6rger","year":"1971"},{"key":"10.1016\/0304-3975(80)90042-0_BIB3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02025119","article-title":"Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen","volume":"16","author":"B\u00f6rger","year":"1974","journal-title":"Arch. Math. Logik Grundlagenforsch."},{"key":"10.1016\/0304-3975(80)90042-0_BIB4","series-title":"Habilitationsschrift","article-title":"Eine einfache Methode zur Bestimmung der Unl\u00f6sbarkeitsgrade von Entscheidungsproblemen kombinatorischer Systeme","author":"B\u00f6rger","year":"1975"},{"key":"10.1016\/0304-3975(80)90042-0_BIB5","series-title":"Z. Math. Logik Grundlagen Math.","first-page":"135","article-title":"A new general approach to the theory of the many-one equivalence of decision problems for algorithmic systems","volume":"25","author":"B\u00f6rger","year":"1979"},{"key":"10.1016\/0304-3975(80)90042-0_BIB6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02276798","article-title":"Die m-Grade logischer Entscheidungsprobleme","volume":"17","author":"B\u00f6rger","year":"1976","journal-title":"Archivf. math. Logik und Grundlagenforschung"},{"key":"10.1016\/0304-3975(80)90042-0_BIB7","series-title":"The Undecidable","author":"Davis","year":"1965"},{"key":"10.1016\/0304-3975(80)90042-0_BIB8","series-title":"Undecidability of Presburger arithmetic with a single monadic predicate letter","author":"Downey","year":"1972"},{"key":"10.1016\/0304-3975(80)90042-0_BIB9","series-title":"Com.-Structures Group","article-title":"Decision problems for Petri nets and vector addition systems","author":"Hack","year":"1974"},{"key":"10.1016\/0304-3975(80)90042-0_BIB10","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/BF01932960","article-title":"Some Post canonical systems in one letter","volume":"12","author":"Hosken","year":"1972","journal-title":"BIT"},{"key":"10.1016\/0304-3975(80)90042-0_BIB11","doi-asserted-by":"crossref","first-page":"489","DOI":"10.2307\/2272891","article-title":"Single premise Post canonical forms defined over one-letter alphabets","volume":"39","author":"Hughes","year":"1974","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(80)90042-0_BIB12","series-title":"The equivalence of vector addition systems to a subclass of Post canonical systems","first-page":"1","author":"Hughes","year":"1977"},{"key":"10.1016\/0304-3975(80)90042-0_BIB13","first-page":"24","article-title":"Some reduction classes and undecidable theories","volume":"4","author":"Lifshitz","year":"1969"},{"key":"10.1016\/0304-3975(80)90042-0_BIB14","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of \u2018Tag\u2019 and other topics in theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Ann. of Math."},{"issue":"1","key":"10.1016\/0304-3975(80)90042-0_BIB15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.2307\/2964057","article-title":"Decidability and essential undecidability","volume":"22","author":"Putnam","year":"1957","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(80)90042-0_BIB16","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(80)90042-0_BIB17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/malq.19650110210","article-title":"Machine configuration and word problems of given degree of unsolvability","volume":"11","author":"Shepherdson","year":"1965","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/0304-3975(80)90042-0_BIB18","first-page":"69","article-title":"Machine configuration and word problems of given degree of unsolvability","author":"Shepherdson","year":"1965"},{"key":"10.1016\/0304-3975(80)90042-0_BIB19","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/0304-3975(80)90042-0_BIB20","series-title":"\u00dcber einige Satzfunktionen in der Arithmetik","author":"Skolem","year":"1931"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900420?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900420?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:24:41Z","timestamp":1555125881000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,6]]}},"alternative-id":["0304397580900420"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90042-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,6]]}}}