{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T09:58:54Z","timestamp":1649152734233},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"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":[[1981,12]]},"DOI":"10.1007\/bf02011640","type":"journal-article","created":{"date-parts":[[2005,8,5]],"date-time":"2005-08-05T06:05:22Z","timestamp":1123221922000},"page":"137-148","source":"Crossref","is-referenced-by-count":0,"title":["Some undecidable theories with monadic predicates and without equality"],"prefix":"10.1007","volume":"21","author":[{"given":"Hans Kleine","family":"B\u00fcning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02011640_CR1","volume-title":"The reachability problem for Petri nets and decision problems for Skolem arithmetic","author":"E. B\u00f6rger","year":"1978","unstructured":"B\u00f6rger, E., Kleine B\u00fcning, H.: The reachability problem for Petri nets and decision problems for Skolem arithmetic. Tagungsband: Mathematische Logik, Oberwolfach, April 1978."},{"key":"BF02011640_CR2","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1090\/S0002-9939-1974-0325378-3","volume":"42","author":"S. Garfunkel","year":"1974","unstructured":"Garfunkel, S., Schmerl, S.H.: The undecidability of theories of groupoids with an extra predicate. Proc. Am. Math. Soc.42, 286\u2013289 (1974).","journal-title":"Proc. Am. Math. Soc."},{"key":"BF02011640_CR3","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. Minsky","year":"1961","unstructured":"Minsky, M.: Recursive unsolvability of post problem of \u201cTag\u201d and other topics in the theory of turning machines. Ann. Math.74, 437\u2013455 (1961).","journal-title":"Ann. Math."},{"key":"BF02011640_CR4","first-page":"217","volume":"10","author":"S.C. Shepherdson","year":"1963","unstructured":"Shepherdson, S.C., Sturgis, H.E.: Computability of recursive functions. ACM10, 217\u2013255 (1963).","journal-title":"ACM"},{"key":"BF02011640_CR5","volume-title":"Mathematical logic","author":"J.R. Shoenfield","year":"1967","unstructured":"Shoenfield, J.R.: Mathematical logic. Reading (Mass.): Addison-Wesley 1967."}],"container-title":["Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02011640.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02011640\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02011640","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T22:24:57Z","timestamp":1557786297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02011640"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF02011640"],"URL":"https:\/\/doi.org\/10.1007\/bf02011640","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}