{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T18:02:24Z","timestamp":1784484144753,"version":"3.55.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032313478","type":"print"},{"value":"9783032313485","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-31348-5_12","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:28Z","timestamp":1784482168000},"page":"178-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexities of\u00a0Effective Reductions with\u00a0Ordinal Turing Machines"],"prefix":"10.1007","author":[{"given":"Merlin","family":"Carl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/9781316717196","volume-title":"Admissible Sets and Structures","author":"J Barwise","year":"2017","unstructured":"Barwise, J.: Admissible Sets and Structures. Cambridge University Press, Cambridge (2017)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Carl, M.: Generalized effective reducibility. In: Beckmann, A., et al. (eds.) Pursuit of the Universal. 12th Conference on Computability in Europe (2016)","DOI":"10.1007\/978-3-319-40189-8_23"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Carl, M.: Effectivity and reducibility with ordinal turing machines. Computability 10(4) (2021)","DOI":"10.3233\/COM-210307"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Carl, M.: Full generalized effective reducibility. In: A. Beckmann et al. (eds.) Crossroads of Computability and Logic: Insights, Inspirations, and Innovations, 21st Conference on Computability in Europe. Proceedings, CiE 2025 Proceedings (2025)","DOI":"10.1007\/978-3-031-95908-0_15"},{"key":"12_CR5","unstructured":"Carl, M.: Effective reducibility for statements of arbitrary quantifier complexity with ordinal turing machines. Preprint: arXiv:2411.19386 (2025)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Carl, M.: Ordinal Computability. An Introduction to Infinitary Machines. De Gruyter Berlin Boston (2019)","DOI":"10.1515\/9783110496154"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Gasarch, W., Martin, G.: Bounded Queries in Recursion Theory. Progress in Computer Science and Applied Logic, vol. 16. Birkh\u00e4user Boston Basel (1998)","DOI":"10.1007\/978-1-4612-0635-4"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Gasarch, W.: Bounded queries in recursion theory: a survey. In: Proceedings of the Sixth Annual Structure in Complexity Theory Conference (1991). https:\/\/doi.org\/10.1109\/SCT.1991.160245","DOI":"10.1109\/SCT.1991.160245"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Gasarch, W., Stephan, F.: A techniques oriented survey of bounded queries. In: Cooper, S., Truss, J. (eds.) Models and Computability. London Mathematical Society Lecture Note Series. Cambridge University Press (1999)","DOI":"10.1017\/CBO9780511565670.006"},{"key":"12_CR10","unstructured":"Hamkins, J.D.: Complexity of definable global choice functions. https:\/\/mathoverflow.net\/users\/1946\/joel-david-hamkins, https:\/\/mathoverflow.net\/q\/472862. Accessed 08 June 2024"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Hodges, W.: On the effectivity of some field constructions. In: Proceedings of the London Mathematical Society, vol. s3-32(1) (1976)","DOI":"10.1112\/plms\/s3-32.1.133"},{"key":"12_CR12","unstructured":"Jech, T.: Set Theory. Third Millenium Edition. Springer, Berlin Heidelberg New York (2003)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Koepke, P.: Turing computations on ordinals. Bull. Symbolic Logic 11(3)","DOI":"10.2178\/bsl\/1122038993"},{"key":"12_CR14","unstructured":"Kunen, K.: Set Theory. An Introduction to Independence Proofs, Elsevier, Amsterdam (1980)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Passmann, R.: The first-order logic of CZF is intuitionistic first-order logic. J. Symbolic Logic 89(1) (2022)","DOI":"10.1017\/jsl.2022.51"},{"key":"12_CR16","unstructured":"Reitz, J.: The Ground Axiom. PhD Thesis, City University of New York (2024). https:\/\/arxiv.org\/pdf\/math\/0609064"},{"key":"12_CR17","unstructured":"Stammes, J.: Ordinal Reductions on Choice Principles. Master Thesis, Universiteit van Amsterdam (2024). https:\/\/dspace.uba.uva.nl\/server\/api\/core\/bitstreams\/82b5ccde-8cc8-464b-a968-74d7ea88b41a\/content"}],"container-title":["Lecture Notes in Computer Science","Timeless Machines: Computability Across Eras"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31348-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:29Z","timestamp":1784482169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"20 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}