{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T12:35:05Z","timestamp":1772368505522,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,1,12]],"date-time":"2010-01-12T00:00:00Z","timestamp":1263254400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00153-009-0167-x","type":"journal-article","created":{"date-parts":[[2010,1,11]],"date-time":"2010-01-11T05:27:40Z","timestamp":1263187660000},"page":"249-273","source":"Crossref","is-referenced-by-count":21,"title":["The basic theory of infinite time register machines"],"prefix":"10.1007","volume":"49","author":[{"given":"Merlin","family":"Carl","sequence":"first","affiliation":[]},{"given":"Tim","family":"Fischbach","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Koepke","sequence":"additional","affiliation":[]},{"given":"Russell","family":"Miller","sequence":"additional","affiliation":[]},{"given":"Miriam","family":"Nasfi","sequence":"additional","affiliation":[]},{"given":"Gregor","family":"Weckbecker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,12]]},"reference":[{"key":"167_CR1","unstructured":"Dimitriou, I., Hamkins, J.D., Koepke, P. (eds.): BIWOC\u2014Bonn International Workshop on Ordinal Computability, Bonn Logic Reports (2007)"},{"issue":"2","key":"167_CR2","doi-asserted-by":"crossref","first-page":"567","DOI":"10.2307\/2586556","volume":"65","author":"J.D. Hamkins","year":"2000","unstructured":"Hamkins J.D., Lewis A.: Infinite time turing machines. J. Symb. Log. 65(2), 567\u2013604 (2000)","journal-title":"J. Symb. Log."},{"key":"167_CR3","doi-asserted-by":"crossref","unstructured":"Hamkins, J.D., Linetsky, D., Miller, R.: The complexity of quickly ORM-decidable sets. In: Cooper, S.B., et\u00a0al. (eds.) Computation and Logic in the Real World, LNCS, vol. 4497, pp. 488\u2013496. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-73001-9_51"},{"key":"167_CR4","doi-asserted-by":"crossref","unstructured":"Hamkins, J.D., Miller, R.: Post\u2019s problem for ordinal register machines. In: Cooper, S.B., et\u00a0al. (eds.) Computation and Logic in the Real World, LNCS. vol. 4497, pp. 358\u2013367. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-73001-9_37"},{"key":"167_CR5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/11780342_27","volume-title":"Logical Approaches to Computational Barriers, LNCS. vol. 3988","author":"P. Koepke","year":"2006","unstructured":"Koepke P., et\u00a0al.: Infinite time register machines. In: Beckmann, A., (eds) Logical Approaches to Computational Barriers, LNCS. vol. 3988, pp. 257\u2013266. Springer, Heidelberg (2006)"},{"key":"167_CR6","doi-asserted-by":"crossref","first-page":"377","DOI":"10.2178\/bsl\/1122038993","volume":"11","author":"P. Koepke","year":"2005","unstructured":"Koepke P.: Turing computations on ordinals. B. Symb. Log. 11, 377\u2013397 (2005)","journal-title":"B. Symb. Log."},{"key":"167_CR7","doi-asserted-by":"crossref","unstructured":"Koepke, P., Miller, R.: An enhanced theory of infinite time register machines. In: Beckmann, A., et\u00a0al. (eds.) Logic and Theory of Algorithms LNCS, vol. 5028, pp. 306\u2013315. (2008)","DOI":"10.1007\/978-3-540-69407-6_34"},{"key":"167_CR8","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s00153-008-0093-3","volume":"47","author":"P. Koepke","year":"2008","unstructured":"Koepke P., Siders R.: Register computations on ordinals. Arch. Math. Log. 47, 529\u2013548 (2008)","journal-title":"Arch. Math. Log."},{"key":"167_CR9","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.apal.2009.01.005","volume":"160","author":"P. Koepke","year":"2009","unstructured":"Koepke P., Seyfferth B.: Ordinal machines and admissible recursion theory. Ann. Pure Appl. Log. 160, 310\u2013318 (2009)","journal-title":"Ann. Pure Appl. Log."},{"key":"167_CR10","unstructured":"Koepke, P., Siders, R.: Computing the recursive truth predicate on ordinal register machines. In: Beckmann, A., et\u00a0al. (eds.) Logical Approaches to Computational Barriers, Computer Science Report Series, vol. 7, pp. 160\u2013169. (2006)"},{"key":"167_CR11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.tcs.2007.12.012","volume":"394","author":"P. Koepke","year":"2008","unstructured":"Koepke P., Siders R.: Minimality considerations for ordinal computers modeling constructibility. Theoretical Comput. Sci. 394, 197\u2013207 (2008)","journal-title":"Theoretical Comput. Sci."},{"key":"167_CR12","unstructured":"Jech, T.: Set Theory, 3rd Millennium edition, revisited and expanded. Springer, Berlin (2002)"},{"key":"167_CR13","doi-asserted-by":"crossref","unstructured":"Jensen, R.B.: The fine structure of the constructible hierarchy. Ann. Math. Log. (1972)","DOI":"10.1016\/0003-4843(72)90001-0"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-009-0167-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-009-0167-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-009-0167-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T22:04:48Z","timestamp":1558735488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-009-0167-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,12]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["167"],"URL":"https:\/\/doi.org\/10.1007\/s00153-009-0167-x","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,12]]}}}