{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:39:39Z","timestamp":1742945979587,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587400"},{"type":"electronic","value":"9783319587417"}],"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-319-58741-7_19","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T12:59:28Z","timestamp":1494507568000},"page":"187-197","source":"Crossref","is-referenced-by-count":3,"title":["Koepke Machines and Satisfiability for Infinitary Propositional Languages"],"prefix":"10.1007","author":[{"given":"Merlin","family":"Carl","sequence":"first","affiliation":[]},{"given":"Benedikt","family":"L\u00f6we","sequence":"additional","affiliation":[]},{"given":"Benjamin G.","family":"Rin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"key":"19_CR1","unstructured":"Carl, M.: Towards a Church-Turing-Thesis for infinitary computation (2013) preprint. \narXiv:1307.6599"},{"key":"19_CR2","unstructured":"Carl, M.: Infinite time recognizability from random oracles and the recognizable jump operator. Computability (to appear)"},{"key":"19_CR3","unstructured":"Dawson, B.: Ordinal time Turing Computation. Ph.D. thesis, University of Bristol (2009)"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Deolalikar, V., Hamkins, J.D., Schindler, R.: \n            $$\\mathbf{P}\\ne \\mathbf{NP}\\cap \\mathbf{co}{\\text{-}}\\mathbf{NP}$$\n           for infinite time Turing machines. J. Log. Comput. 15(5), 577\u2013592 (2005)","DOI":"10.1093\/logcom\/exi022"},{"issue":"2","key":"19_CR5","doi-asserted-by":"crossref","first-page":"567","DOI":"10.2307\/2586556","volume":"65","author":"JD 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."},{"issue":"5","key":"19_CR6","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1002\/malq.200310057","volume":"49","author":"JD Hamkins","year":"2003","unstructured":"Hamkins, J.D., Welch, P.D.: \n            $$\\mathbf{P}^f \\ne \\mathbf{NP}^f$$\n           for almost all \n            $$f$$\n          . Math. Log. Q. 49(5), 536\u2013540 (2003)","journal-title":"Math. Log. Q."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Jensen, R.B., Karp, C.: Primitive recursive set functions. In: Axiomatic Set Theory. Proceedings of the Symposium in Pure Mathematics of the American Mathematical Society held at the University of California, Los Angeles, California, 10 July\u20135 August, vol. XIII\/I of Proceedings of Symposia in Pure Mathematics, pp. 143\u2013176. American Mathematical Society (1971)","DOI":"10.1090\/pspum\/013.1\/0281602"},{"key":"19_CR8","series-title":"Springer Monographs in Mathematics","volume-title":"The Higher Infinite. Large Cardinals in Set Theory from Their Beginnings","author":"A Kanamori","year":"2003","unstructured":"Kanamori, A.: The Higher Infinite. Large Cardinals in Set Theory from Their Beginnings. Springer Monographs in Mathematics, 2nd edn. Springer, Heidelberg (2003)","edition":"2"},{"key":"19_CR9","volume-title":"Languages with Expressions of Infinite Length","author":"C Karp","year":"1964","unstructured":"Karp, C.: Languages with Expressions of Infinite Length. North-Holland, Amsterdam (1964)"},{"issue":"3","key":"19_CR10","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. Bull. Symb. Log. 11(3), 377\u2013397 (2005)","journal-title":"Bull. Symb. Log."},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-03073-4_29","volume-title":"Mathematical Theory and Computational Practice","author":"P Koepke","year":"2009","unstructured":"Koepke, P.: Ordinal computability. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 280\u2013289. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-03073-4_29"},{"key":"19_CR12","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":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11780342_34","volume-title":"Logical Approaches to Computational Barriers","author":"B L\u00f6we","year":"2006","unstructured":"L\u00f6we, B.: Space bounds for infinitary computation. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 319\u2013329. Springer, Heidelberg (2006). doi:\n10.1007\/11780342_34"},{"issue":"9","key":"19_CR14","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1016\/j.apal.2014.04.016","volume":"165","author":"B Rin","year":"2014","unstructured":"Rin, B.: The computational strengths of \n            $$\\alpha $$\n          -tape infinite time turing machines. Ann. Pure Appl. Log. 165(9), 1501\u20131511 (2014)","journal-title":"Ann. Pure Appl. Log."},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00605-002-0545-5","volume":"139","author":"R Schindler","year":"2003","unstructured":"Schindler, R.: \n            $$\\mathbf{P}\\ne \\mathbf{NP}$$\n           infinite time turing machines. Monatsh. Math. 139, 335\u2013340 (2003)","journal-title":"Monatsh. Math."},{"key":"19_CR16","unstructured":"Winter, J.: Space complexity in infinite time Turing machines. Master\u2019s thesis, Universiteit van Amsterdam. ILLC Publications MoL-2007-14 (2007)"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-03092-5_10","volume-title":"Infinity in Logic and Computation","author":"J Winter","year":"2009","unstructured":"Winter, J.: Is P = PSPACE for Infinite time turing machines? In: Archibald, M., Brattka, V., Goranko, V., L\u00f6we, B. (eds.) ILC 2007. LNCS, vol. 5489, pp. 126\u2013137. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-03092-5_10"}],"container-title":["Lecture Notes in Computer Science","Unveiling Dynamics and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58741-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T09:02:29Z","timestamp":1504170149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58741-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587400","9783319587417"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58741-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}