{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:12:51Z","timestamp":1648915971446},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-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":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch math Logik"],"published-print":{"date-parts":[[1980,6]]},"DOI":"10.1007\/bf02318025","type":"journal-article","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T16:16:19Z","timestamp":1140020179000},"page":"43-49","source":"Crossref","is-referenced-by-count":2,"title":["Prefix classes of krom formulae with identity"],"prefix":"10.1007","volume":"22","author":[{"given":"Stal O.","family":"Aanderaa","sequence":"first","affiliation":[]},{"given":"Egon","family":"B\u00f6rger","sequence":"additional","affiliation":[]},{"given":"Yuri","family":"Gurevich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02318025_CR1","first-page":"1","volume-title":"Proc. of the Second Scandinavian Logic Symposium","author":"S.O. Aanderaa","year":"1971","unstructured":"Aanderaa, S.O.: On the decision problem for formulas in which all disjunctions are binary. In: Fenstad, J.E., (ed.): Proc. of the Second Scandinavian Logic Symposium, pp. 1\u201318. Amsterdam: North-Holland 1971."},{"key":"BF02318025_CR2","doi-asserted-by":"crossref","first-page":"628","DOI":"10.2307\/2271987","volume":"38","author":"S.O. Aanderaa","year":"1973","unstructured":"Aanderaa, S.O., Lewis, H.R.: Prefix classes of Krom formulas. J. Symb. Logic38, 628\u2013642 (1973)","journal-title":"J. Symb. Logic"},{"key":"BF02318025_CR3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02025119","volume":"16","author":"E. B\u00f6rger","year":"1971","unstructured":"B\u00f6rger, E.: Reduktionstypen in Krom- und Hornformeln. Dissertation, M\u00fcnster. See Arch. math. Logik16, 67\u201384 (1971).","journal-title":"Dissertation, M\u00fcnster. See Arch. math. Logik"},{"key":"BF02318025_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1002\/malq.19730190803","volume":"19","author":"E. B\u00f6rger","year":"1973","unstructured":"B\u00f6rger, E.: Eine entscheidbare Klasse von Kromformeln. In: Z. math. Logik u. Grundlagen d. Mathematik19, 117\u2013120 (1973).","journal-title":"Z. math. Logik u. Grundlagen d. Mathematik"},{"key":"BF02318025_CR5","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1017\/S0022481200051513","volume":"41","author":"Ju. Gurevich","year":"1976","unstructured":"Gurevich, Ju.: The decision problem for standard classes. J. Symb. Logic41, 460\u2013464 (1976).","journal-title":"J. Symb. Logic"},{"key":"BF02318025_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02007254","volume":"18","author":"Ju. Gurevich","year":"1976","unstructured":"Gurevich, Ju.: Semi-conservative reduction. Arch. math. Logik18, 23\u201325 (1976a).","journal-title":"Arch. math. Logik"},{"key":"BF02318025_CR7","volume-title":"\u00c9l\u00e9ments de logique math\u00e9matique. Th\u00e9orie des mod\u00e8les","author":"G. Kreisel","year":"1967","unstructured":"Kreisel, G., Krivine, J.L., \u00c9l\u00e9ments de logique math\u00e9matique. Th\u00e9orie des mod\u00e8les. Paris: Dunod 1967."},{"key":"BF02318025_CR8","first-page":"17","volume":"159","author":"S.Ju. Maslov","year":"1964","unstructured":"Maslov, S.Ju.: An inverse method for establishing deducibilities in the classical predicate calculus. Dokl. Akad. Nauk SSSR159, 17\u201320 (1964) = Soviet Math. Doklady 5.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"BF02318025_CR9","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M.L. Minsky","year":"1961","unstructured":"Minsky, M.L.: Recursive unsolvability of Post's problem of \u201ctag\u201d and other topics in theory of Turing machines. Ann. Math.74, 437\u2013455 (1961).","journal-title":"Ann. Math."},{"key":"BF02318025_CR10","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BF02759780","volume":"28","author":"S. Shelah","year":"1977","unstructured":"Shelah, S.: Decidability of a portion of the predicate calculus. Israel J. Math.28, 32\u201344 (1977).","journal-title":"Israel J. Math."},{"key":"BF02318025_CR11","doi-asserted-by":"crossref","unstructured":"Shepherdson, J.C., Sturgis, H.E.: Computability of recursive functions. 217\u2013255 (1963).","DOI":"10.1145\/321160.321170"}],"container-title":["Archiv f\u00fcr mathematische Logik und Grundlagenforschung"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02318025.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02318025\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02318025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:57:36Z","timestamp":1558029456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02318025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,6]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1980,6]]}},"alternative-id":["BF02318025"],"URL":"https:\/\/doi.org\/10.1007\/bf02318025","relation":{},"ISSN":["0003-9268","1432-0665"],"issn-type":[{"value":"0003-9268","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,6]]}}}