{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:53:28Z","timestamp":1752360808094,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662553855"},{"type":"electronic","value":"9783662553862"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-55386-2_10","type":"book-chapter","created":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T11:24:53Z","timestamp":1498649093000},"page":"140-152","source":"Crossref","is-referenced-by-count":1,"title":["Computable Quotient Presentations of Models of Arithmetic and Set Theory"],"prefix":"10.1007","author":[{"given":"Micha\u0142 Tomasz","family":"Godziszewski","sequence":"first","affiliation":[]},{"given":"Joel David","family":"Hamkins","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,29]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Enayat, A., Schmerl, J., Visser, A.: $$\\omega $$ -models of finite set theory. In: Kennedy, J., Kossak, R. (eds.) Set Theory, Arithmetic, and Foundations of Mathematics: Theorems, Philosophies. Lecture Notes in Logic, no. 36. Cambridge University Press, Cambridge (2011)","DOI":"10.1017\/CBO9780511910616.004"},{"key":"10_CR2","unstructured":"Khoussainov, B.: Computably enumerable structures: domain dependence, September 2016. Slides for Conference Talk at Mathematical Logic and Its Applications, Research Institute for Mathematical Sciences (RIMS), Kyoto University. http:\/\/www2.kobe-u.ac.jp\/~mkikuchi\/mla2016khoussainov.pdf"},{"issue":"4","key":"10_CR3","doi-asserted-by":"crossref","first-page":"408","DOI":"10.2307\/2964015","volume":"23","author":"MO Rabin","year":"1958","unstructured":"Rabin, M.O.: On recursively enumerable and arithmetic models of set theory. J. Symb. Log. 23(4), 408\u2013416 (1958)","journal-title":"J. Symb. Log."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55386-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T03:12:49Z","timestamp":1659150769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55386-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662553855","9783662553862"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55386-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}