{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T18:02:26Z","timestamp":1784484146333,"version":"3.55.0"},"publisher-location":"Cham","reference-count":12,"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_13","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:55Z","timestamp":1784482195000},"page":"193-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Weihrauch Reducibility Between Ramsey-Type Theorems and\u00a0Well-Ordering Principles at\u00a0the\u00a0Level of\u00a0$$\\varSigma ^0_2$$-Induction"],"prefix":"10.1007","author":[{"given":"Lorenzo","family":"Carlucci","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giordano","family":"Celli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Brattka, V., Gherardi, G., Pauly, A.: Weihrauch complexity in computable analysis. In: Brattka, V., Hertling, P. (eds.) Handbook of Computability and Complexity in Analysis. Theory and Applications of Computability, pp. 367\u2013417. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-59234-9_11"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Carlucci, L., Mainardi, L., Zdanowski, K.: Reductions of well-ordering principles to combinatorial theorems. To appear in Notre Dame Journal of Formal Logic. 67(2), 199\u2013218 (2026)","DOI":"10.1215\/00294527-2025-0028"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-30870-3_10","volume-title":"How the World Computes","author":"L Carlucci","year":"2012","unstructured":"Carlucci, L., Zdanowski, K.: A note on Ramsey theorems and Turing jumps. In: Cooper, S.B., Dawar, A., L\u00f6we, B. (eds.) CiE 2012. LNCS, vol. 7318, pp. 89\u201395. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30870-3_10"},{"issue":"3\u20134","key":"13_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.3233\/COM-180244","volume":"9","author":"C Davis","year":"2020","unstructured":"Davis, C., Hirschfeldt, D.R., Hirst, J.L., Pardo, J., Pauly, A., Yokoyama, K.: Combinatorial principles equivalent to weak induction. Computability 9(3\u20134), 219\u2013229 (2020)","journal-title":"Computability"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Dzhafarov, D., Mumert, C.: Reverse Mathematics. Problems, Reductions, and Proofs. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-11367-3"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(94)90076-0","volume":"66","author":"JL Hirst","year":"1994","unstructured":"Hirst, J.L.: Reverse mathematics and ordinal exponentiation. Ann. Pure Appl. Logic 66, 1\u201318 (1994)","journal-title":"Ann. Pure Appl. Logic"},{"key":"13_CR7","unstructured":"Hirst, J.L.: Combinatorics in Subsystems of Second Order Arithmetic. Ph.D. thesis, The Pennsylvania State University, ProQuest LLC, Ann Arbor, MI (1987)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Kolodziejczyk, L.A., Michalewski, H., Pradic, C., Skrzypczak, M.: The logical strength of B\u00fcchi\u2019s decidability theorem. Logical Methods Comput. Sci. 15(2), 1\u201331 (2019)","DOI":"10.23638\/LMCS-15(2:16)2019"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"575","DOI":"10.2178\/jsl\/1305810765","volume":"76","author":"A Marcone","year":"2011","unstructured":"Marcone, A., Montalb\u00e0n, A.: The Veblen function for computability theorists. J. Symbolic Logic 76(2), 575\u2013602 (2011)","journal-title":"J. Symbolic Logic"},{"issue":"3\u20134","key":"13_CR10","doi-asserted-by":"publisher","first-page":"459","DOI":"10.3233\/COM-230437","volume":"13","author":"A Pauly","year":"2024","unstructured":"Pauly, A., Pradic, C., Sold\u00e0, G.: On the Weihrauch degree of the additive Ramsey theorem. Computability 13(3\u20134), 459\u2013483 (2024)","journal-title":"Computability"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Rathjen, M., Weiermann, A.: Reverse mathematics and well-ordering principles. In: Cooper, S.B., Sorbi, A. (eds.) Computability in context, pp. 351\u2013370. Imperial College Press (2011)","DOI":"10.1142\/9781848162778_0011"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.apal.2022.103232","volume":"174","author":"P Uftring","year":"2023","unstructured":"Uftring, P.: Weak and strong versions of effective transfinite recursion. Ann. Pure Appl. Logic 174, 4 (2023)","journal-title":"Ann. Pure Appl. Logic"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:55Z","timestamp":1784482195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_13","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"}}]}}