{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:11:40Z","timestamp":1743099100525,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031643088"},{"type":"electronic","value":"9783031643095"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-64309-5_13","type":"book-chapter","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:01:49Z","timestamp":1719871309000},"page":"153-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Almost Sure OTM-Realizability"],"prefix":"10.1007","author":[{"given":"Merlin","family":"Carl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Barwise, J.: Admissible Sets and Structures. Perspectives in Logic. Cambridge University Press (2017). https:\/\/doi.org\/10.1017\/9781316717196","DOI":"10.1017\/9781316717196"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Bogachev, V.: Measure Theory, vol. 1. Physica-Verlag (2007)","DOI":"10.1007\/978-3-540-34514-5"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Carl, M.: Ordinal Computability. An Introduction to Infinitary Machines, De Gruyter (2019)","DOI":"10.1515\/9783110496154"},{"key":"13_CR4","unstructured":"Carl, M.: A Note on OTM-Realizability and Constructive Set Theories. Preprint. arXiv:1903.08945 (2019)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Carl, M., Schlicht, P.: Infinite computations with random oracles. Notre Dame J. Formal Logic 58(2) (2017)","DOI":"10.1215\/00294527-3832619"},{"key":"13_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"R Downey","year":"2010","unstructured":"Downey, R., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Springer, Cham (2010)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Carl, M., Galeotti, L., Passmann, R.: Realisability for infinitary intuitionistic set theory. Ann. Pure Appl. Logic 174(6) (2023)","DOI":"10.1016\/j.apal.2023.103259"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-030-80049-9_8","volume-title":"Connecting with Computability","author":"M Carl","year":"2021","unstructured":"Carl, M., Galeotti, L., Passmann, R.: Randomising realizability. In: De Mol, L., Weiermann, A., Manea, F., Fern\u00e1ndez-Duque, D. (eds.) CiE 2021. LNCS, vol. 12813, pp. 82\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80049-9_8"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Hodges, W.: On the effectivity of some field constructions. In: Proceedings of the London Mathematical Society, pp. s3\u201332(1) (1976)","DOI":"10.1112\/plms\/s3-32.1.133"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Iemhoff, R., Passmann, R.: Logics of intuitionistic Kripke-Platek set theory. Ann. Pure Appl. Logic 172(10) (2021)","DOI":"10.1016\/j.apal.2021.103014"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Koepke, P.: Turing computations on ordinals. Bull. Symb. Logic 11(3) (2005). https:\/\/doi.org\/10.2178\/bsl\/1122038993","DOI":"10.2178\/bsl\/1122038993"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Lubarsky, B.: IKP and friends. J. Symb. Logic 67(4) (2002). https:\/\/doi.org\/10.2178\/jsl\/1190150286","DOI":"10.2178\/jsl\/1190150286"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"McCarty, C., Shapiro, S., Klev, A.: The axiom of choice is false intuitionistically (in most contexts). Bull. Symb. Logic 29(1) (2023). https:\/\/doi.org\/10.1017\/bsl.2022.22","DOI":"10.1017\/bsl.2022.22"},{"key":"13_CR14","unstructured":"Moschovakis, J.: Intuitionistic logic. In: Zalta, E., Nodelman, U. (eds.) The Stanford Encyclopedia of Philosophy (2023). https:\/\/plato.stanford.edu\/archives\/sum2023\/entries\/logic-intuitionistic\/. Accessed 05 Feb 2024"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Martin, D., Steel, J.: A proof of projective determinacy. J. Am. Math. Soc. 2(1) (1989)","DOI":"10.2307\/1990913"},{"key":"13_CR16","unstructured":"Rathjen, M.: Choice principles in constructive and classical set theories. In: Chatzidakis, Z., Koepke, P., Pohlers, W. (eds.) Logic Colloquium 2002. Lecture Notes in Logic. Cambridge University Press (2006)"},{"key":"13_CR17","unstructured":"Wontner, N.: Views from a Peak. Generalisations and descriptive set theory. ILLC Dissertation Series DS-2023-NN (2023)"}],"container-title":["Lecture Notes in Computer Science","Twenty Years of Theoretical and Practical Synergies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64309-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:02:51Z","timestamp":1719871371000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64309-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643088","9783031643095"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64309-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"2 July 2024","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":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}