{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:54Z","timestamp":1725662934083},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540074076"},{"type":"electronic","value":"9783540379232"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07407-4_16","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T10:56:50Z","timestamp":1330167410000},"page":"127-133","source":"Crossref","is-referenced-by-count":4,"title":["Zur Entscheidbarkeit der funktionalen \u00c4quivalenz"],"prefix":"10.1007","author":[{"given":"H.","family":"Beck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"16_CR1","unstructured":"Grzegorczyk, A.: \"Some classes of recursive functions\", Rozprawy Mathematyczne 4. (1953)"},{"key":"16_CR2","first-page":"354","volume":"11","author":"J. V. Matijasevi\u010d","year":"1970","unstructured":"Matijasevi\u010d, J.V.: \"Enumerable sets are Diophantine\", Soviet Math. Dokl. 11, 354\u2013358. (1970)","journal-title":"Soviet Math. Dokl."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., D.M. Ritchie: \"The complexity of loop programs\", Proc. 22nd Nat. Conf. ACM, 1967, ACM Pub P-67, pp. 465\u2013469","DOI":"10.1145\/800196.806014"},{"key":"16_CR4","unstructured":"Presburger, M.: \"\u00fcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchen die Addition als einzige Operation hervortritt\", Comptesrendus du I Congr\u00e8s des Math\u00e9maticiens des Pays Slaves, Warsaw (1930) pp. 92\u2013101, 395"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1145\/321607.321621","volume":"17","author":"D. Tsichritzis","year":"1970","unstructured":"Tsichritzis, D.: \"The equivalence problem of simple programs\", Journal of the Association for Computing Machinery 17: 729\u2013738. (1970)","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20\u201323, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07407-4_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:46:21Z","timestamp":1619541981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07407-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540074076","9783540379232"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-07407-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}