{"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":1784484144182,"version":"3.55.0"},"publisher-location":"Cham","reference-count":25,"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_14","type":"book-chapter","created":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:40Z","timestamp":1784482180000},"page":"208-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Free Sets, Thin Sets and\u00a0Rainbows for\u00a0Barriers"],"prefix":"10.1007","author":[{"given":"Lorenzo","family":"Carlucci","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oriola","family":"Gjetaj","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"issue":"4","key":"14_CR1","first-page":"89","volume":"11","author":"M Assous","year":"1974","unstructured":"Assous, M.: Caract\u00e9risation du type d\u2019ordre des barri\u00e8res de Nash-Williams. Publications du D\u00e9partement de math\u00e9matiques (Lyon) 11(4), 89\u2013106 (1974)","journal-title":"Publications du D\u00e9partement de math\u00e9matiques (Lyon)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Carlucci, L., Gjetaj, O., Le Hou\u00e9rou, Q., Patey, L.L.: Ramsey-like theorems for the Schreier barrier. J. Symb. Log. 1\u201329 (2025)","DOI":"10.1017\/jsl.2025.10104"},{"key":"14_CR3","unstructured":"Carlucci, L., Volpi, A., Zdanowski, K.: The strength of Ramsey\u2019s theorem for coloring. $$\\alpha $$-large sets (2026). arXiv:2603.22579"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1017\/jsl.2013.27","volume":"79","author":"L Carlucci","year":"2014","unstructured":"Carlucci, L., Zdanowski, K.: The strength of Ramsey\u2019s theorem for coloring relatively large sets. J. Symb. Log. 79(1), 89\u2013102 (2014)","journal-title":"J. Symb. Log."},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.4064\/fm227-3-2","volume":"227","author":"R Carroy","year":"2014","unstructured":"Carroy, R., Pequignot, Y.: From well to better, the space of ideals. Fundam. Math. 227(3), 247\u2013270 (2014)","journal-title":"Fundam. Math."},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1090\/tran\/7987","volume":"373","author":"P Cholak","year":"2020","unstructured":"Cholak, P., Patey, L.: Thin set theorems and cone avoidance. Trans. Amer. Math. Soc. 373(4), 2743\u20132773 (2020)","journal-title":"Trans. Amer. Math. Soc."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Cholak, P.A., Giusto, M., Hirst, J.L., Jockusch, Jr. C.G.: Free sets and reverse mathematics. In: Reverse mathematics 2001, volume\u00a021 of Lecture Notes in Logic, pp. 104\u2013119. Assoc. Symbol. Logic, La Jolla (2005)","DOI":"10.1017\/9781316755846.006"},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"376","DOI":"10.2307\/2274171","volume":"49","author":"P Clote","year":"1984","unstructured":"Clote, P.: A recursion theoretic analysis of the Clopen Ramsey theorem. J. Symb. Log. 49(2), 376\u2013400 (1984)","journal-title":"J. Symb. Log."},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.2307\/2274051","volume":"51","author":"P Clote","year":"1986","unstructured":"Clote, P.: A generalization of the limit lemma and Clopen games. J. Symb. Log. 51(2), 273\u2013291 (1986)","journal-title":"J. Symb. Log."},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.2178\/jsl\/1254748693","volume":"74","author":"BF Csima","year":"2009","unstructured":"Csima, B.F., Mileti, J.R.: The strength of the rainbow Ramsey theorem. J. Symb. Log. 74(4), 1310\u20131324 (2009)","journal-title":"J. Symb. Log."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Dorais, F., Dzhafarov, D., Hirst, J., Mileti, J., Shafer, P.: On uniform relationships between combinatorial problems. Trans. Amer. Math. Soc. 368(2), 1321\u20131359 (2016)","DOI":"10.1090\/tran\/6465"},{"key":"14_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-11367-3","volume-title":"Reverse Mathematics: Problems, Reductions, and Proofs. Theory and Applications of Computability","author":"DD Dzhafarov","year":"2022","unstructured":"Dzhafarov, D.D., Mummert, C.: Reverse Mathematics: Problems, Reductions, and Proofs. Theory and Applications of Computability. Springer International Publishing, Cham (2022)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Galvin, F., Prikry, K.: Borel sets and Ramsey\u2019s theorem. J. Symb. Log. 38(2), 193\u2013198 (1973)","DOI":"10.2307\/2272055"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"268","DOI":"10.2307\/2272972","volume":"37","author":"CG Jockusch","year":"1972","unstructured":"Jockusch, C.G.: Ramsey\u2019s theorem and recursion theory. J. Symb. Log. 37(2), 268\u2013280 (1972)","journal-title":"J. Symb. Log."},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1017\/jsl.2021.98","volume":"87","author":"L Liu","year":"2022","unstructured":"Liu, L., Patey, L.: The reverse mathematics of the Thin set and Erd\u0151s-Moser theorems. J. Symb. Log. 87(1), 313\u2013346 (2022)","journal-title":"J. Symb. Log."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Marcone, A.: Wqo and Bqo theory in subsystems of second order arithmetic. In: Reverse Mathematics 2001, volume\u00a021 of Lect. Notes Log., pp. 303\u2013330. Assoc. Symbol. Logic, La Jolla (2005)","DOI":"10.1017\/9781316755846.020"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Marcone, A., Montalb\u00e1n, A., Volpi, A.: The barrier Ramsey theorem (2025). arXiv:2505.02544","DOI":"10.1090\/tran\/9784"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Nash-Williams, C.S.J.A.: On better-quasi-ordering transfinite sequences. Proc. Cambridge Philos. Soc. 64, 273\u2013290 (1968)","DOI":"10.1017\/S030500410004281X"},{"issue":"2","key":"14_CR19","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/s11856-016-1433-3","volume":"216","author":"L Patey","year":"2016","unstructured":"Patey, L.: The weakness of being cohesive, thin or free in reverse mathematics. Israel J. Math. 216(2), 905\u2013955 (2016)","journal-title":"Israel J. Math."},{"issue":"2","key":"14_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5802\/aif.408","volume":"22","author":"M Pouzet","year":"1972","unstructured":"Pouzet, M.: Sur les pr\u00e9meilleurordres. Ann. Inst. Four. 22(2), 1\u201319 (1972)","journal-title":"Ann. Inst. Four."},{"key":"14_CR21","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, 1st mit press edition (1987)"},{"key":"14_CR22","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic. Perspectives in Logic. Cambridge University Press, Cambridge; Association for Symbolic Logic, Poughkeepsie, NY, second edition (2009)"},{"issue":"2","key":"14_CR23","doi-asserted-by":"publisher","first-page":"151","DOI":"10.2307\/2266902","volume":"20","author":"C Spector","year":"1955","unstructured":"Spector, C.: Recursive well-orderings. J. Symb. Log. 20(2), 151\u2013163 (1955)","journal-title":"J. Symb. Log."},{"key":"14_CR24","doi-asserted-by":"publisher","DOI":"10.1515\/9781400835409","volume-title":"Introduction to Ramsey Spaces","author":"S Todorcevic","year":"2010","unstructured":"Todorcevic, S.: Introduction to Ramsey Spaces. Princeton University Press, Princeton (2010)"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.aim.2014.05.003","volume":"261","author":"W Wang","year":"2014","unstructured":"Wang, W.: Some logically weak Ramseyan theorems. Adv. Math. 261, 1\u201325 (2014)","journal-title":"Adv. Math."}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T17:29:41Z","timestamp":1784482181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31348-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"ISBN":["9783032313478","9783032313485"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31348-5_14","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"}}]}}