{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T11:11:43Z","timestamp":1773141103438,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319200279","type":"print"},{"value":"9783319200286","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-20028-6_30","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:37Z","timestamp":1434708457000},"page":"291-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Iterative Forcing and Hyperimmunity in Reverse Mathematics"],"prefix":"10.1007","author":[{"given":"Ludovic","family":"Patey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"30_CR1","unstructured":"Bovykin, A., Weiermann, A.: The strength of infinitary ramseyan principles can be accessed by their densities. Ann. Pure Appl. Log. 4 (2005)"},{"key":"30_CR2","first-page":"104","volume":"21","author":"PA Cholak","year":"2001","unstructured":"Cholak, P.A., Giusto, M., Hirst, J.L., Jockusch Jr., C.G.: Free sets and reverse mathematics. Reverse Math. 21, 104\u2013119 (2001)","journal-title":"Reverse Math."},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2694910","volume":"66","author":"PA Cholak","year":"2001","unstructured":"Cholak, P.A., Jockusch, C.G., Slaman, T.A.: On the strength of Ramsey\u2019s theorem for pairs. J. Symb. Log. 66, 1\u201355 (2001)","journal-title":"J. Symb. Log."},{"issue":"04","key":"30_CR4","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(04), 1310\u20131324 (2009)","journal-title":"J. Symb. Log."},{"key":"30_CR5","unstructured":"Flood, S., Towsner, H.: Separating principles below WKL$${}_0$$ (2014). In preparation"},{"key":"30_CR6","unstructured":"Friedman, H.M.: Fom:53:free sets and reverse math and fom:54:recursion theory and dynamics (1999). http:\/\/www.math.psu.edu\/simpson\/fom\/"},{"key":"30_CR7","unstructured":"Friedman, H.M.: Some systems of second order arithmetic and their use. In: Proceedings of the International Congress of Mathematicians, Vancouver, vol. 1, pp. 235\u2013242 (1974)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Hirschfeldt, D.R.: Slicing the truth. Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, vol. 28 (2014)","DOI":"10.1142\/9208"},{"key":"30_CR9","unstructured":"Hirschfeldt, D.R., Jockusch Jr., C.G.: On notions of computability theoretic reduction between $$\\Pi ^1_2$$ principles. To appear"},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2178\/jsl\/1174668391","volume":"72","author":"DR Hirschfeldt","year":"2007","unstructured":"Hirschfeldt, D.R., Shore, R.A.: Combinatorial principles weaker than Ramsey\u2019s theorem for pairs. J. Symb. Log. 72(1), 171\u2013206 (2007)","journal-title":"J. Symb. Log."},{"issue":"11","key":"30_CR11","doi-asserted-by":"publisher","first-page":"5805","DOI":"10.1090\/S0002-9947-09-04847-8","volume":"361","author":"DR Hirschfeldt","year":"2009","unstructured":"Hirschfeldt, D.R., Shore, R.A., Slaman, T.A.: The atomic model theorem and type omitting. Trans. Am. Math. Soc. 361(11), 5805\u20135837 (2009)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1002\/malq.19930390153","volume":"39","author":"C Jockusch","year":"1993","unstructured":"Jockusch, C., Stephan, F.: A cohesive set which is not high. Math. Log. Q. 39(1), 515\u2013530 (1993)","journal-title":"Math. Log. Q."},{"key":"30_CR13","first-page":"33","volume":"173","author":"CG Jockusch","year":"1972","unstructured":"Jockusch, C.G., Soare, R.I.: $$\\Pi ^0_1$$ classes and degrees of theories. Trans. Am. Math. Soc. 173, 33\u201356 (1972)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"30_CR14","doi-asserted-by":"publisher","first-page":"1350007","DOI":"10.1142\/S0219061313500074","volume":"13","author":"M Lerman","year":"2013","unstructured":"Lerman, M., Solomon, R., Towsner, H.: Separating principles below Ramsey\u2019s theorem for pairs. J. Math. Log. 13(2), 1350007 (2013)","journal-title":"J. Math. Log."},{"key":"30_CR15","unstructured":"Patey, L.: A note on \u201cSeparating principles below Ramsey\u2019s theorem for pairs\u201d (2013). Unpublished"},{"key":"30_CR16","unstructured":"Patey, L.: Controlling iterated jumps of solutions to combinatorial problems (2014). In preparation"},{"key":"30_CR17","unstructured":"Patey, L.: Combinatorial weaknesses of ramseyan principles (2015). In preparation"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Patey, L.: Degrees bounding principles and universal instances in reverse mathematics (2015). Submitted","DOI":"10.1016\/j.apal.2015.07.003"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Patey, L.: Ramsey-type graph coloring and diagonal non-computability (2015). Submitted","DOI":"10.1007\/s00153-015-0448-5"},{"key":"30_CR20","unstructured":"Patey, L.: Somewhere over the rainbow Ramsey theorem for pairs (2015). Submitted"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Patey, L.: The weakness of being cohesive, thin or free in reverse mathematics (2015). Submitted","DOI":"10.1007\/s11856-016-1433-3"},{"key":"30_CR22","unstructured":"Rice, B.: Thin set for pairs implies DNR. Notre Dame J. Formal Log. To appear"},{"key":"30_CR23","unstructured":"Wang, W.: The definability strength of combinatorial principles (2014)"},{"key":"30_CR24","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","Evolving Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20028-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T12:47:58Z","timestamp":1675860478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20028-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319200279","9783319200286"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20028-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}