{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T11:11:41Z","timestamp":1773141101977,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319401881","type":"print"},{"value":"9783319401898","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40189-8_36","type":"book-chapter","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T11:34:07Z","timestamp":1465817647000},"page":"353-363","source":"Crossref","is-referenced-by-count":7,"title":["Partial Orders and Immunity 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":[[2016,6,14]]},"reference":[{"key":"36_CR1","unstructured":"Bienvenu, L., Patey, L., Shafer, P.: On the logical strengths of partial solutions to mathematical problems (2015). http:\/\/arxiv.org\/abs\/1411.5874"},{"key":"36_CR2","unstructured":"Bovykin, A., Weiermann, A.: The strength of infinitary Ramseyan principles can be accessed by their densities. Ann. Pure Appl. Logic, 4 (2005 to appear)"},{"key":"36_CR3","unstructured":"Cholak, P.A., Giusto, M., Hirst, J.L., Jockusch, Jr., C.G.: Free sets and reverse mathematics. Reverse Math. 21, 104\u2013119 (2001)"},{"issue":"01","key":"36_CR4","doi-asserted-by":"crossref","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. Symbolic Logic 66(01), 1\u201355 (2001)","journal-title":"J. Symbolic Logic"},{"issue":"04","key":"36_CR5","doi-asserted-by":"crossref","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. Symbolic Logic 74(04), 1310\u20131324 (2009)","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"36_CR6","doi-asserted-by":"crossref","first-page":"557","DOI":"10.2178\/jsl\/1243948327","volume":"74","author":"DD Dzhafarov","year":"2009","unstructured":"Dzhafarov, D.D., Jockusch, C.G.: Ramsey\u2019s theorem and cone avoidance. J. Symbolic Logic 74(2), 557\u2013578 (2009)","journal-title":"J. Symbolic Logic"},{"key":"36_CR7","unstructured":"Friedman, H.: Adjacent ramsey theory. preprint, 8 (2010). https:\/\/u.osu.edu\/friedman.8\/"},{"issue":"2","key":"36_CR8","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1090\/proc12759","volume":"144","author":"H Friedman","year":"2016","unstructured":"Friedman, H., Pelupessy, F.: Independence of Ramsey theorem variants using $$\\varepsilon _0$$ \u03b5 0 . Proc. Am. Math. Soc. 144(2), 853\u2013860 (2016)","journal-title":"Proc. Am. Math. Soc."},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1142\/9789812796554_0008","volume":"15","author":"DR Hirschfeldt","year":"2008","unstructured":"Hirschfeldt, D.R., Jockusch, C.G., Kjos-Hanssen, B., Lempp, S., Slaman, T.A.: The strength of some combinatorial principles related to Ramsey\u2019s theorem for pairs. Comput. Prospects Infinity Part II: Presented Talks 15, 143\u2013161 (2008). World Scientific Press, Singapore","journal-title":"Comput. Prospects Infinity Part II: Presented Talks"},{"issue":"1","key":"36_CR10","doi-asserted-by":"crossref","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. Symbolic Logic 72(1), 171\u2013206 (2007)","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"36_CR11","doi-asserted-by":"crossref","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. Symbolic Logic 37(2), 268\u2013280 (1972)","journal-title":"J. Symbolic Logic"},{"key":"36_CR12","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BFb0076224","volume-title":"Recursion Theory Week","author":"A Ku\u010dera","year":"1985","unstructured":"Ku\u010dera, A.: Measure, $$\\Pi ^0_1$$ \u03a0 1 0 classes, and complete extensions of PA. In: Ebbinghaus, H.-D., M\u00fcller, G.H., Sacks, G.E. (eds.) Recursion Theory Week. Lecture Notes in Mathematics, vol. 1141, pp. 245\u2013259. Springer, Heidelberg (1985)"},{"issue":"02","key":"36_CR13","doi-asserted-by":"crossref","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. Logic 13(02), 1350007 (2013)","journal-title":"J. Math. Logic"},{"issue":"3","key":"36_CR14","doi-asserted-by":"crossref","first-page":"1609","DOI":"10.1090\/S0002-9947-2014-06049-2","volume":"367","author":"L Liu","year":"2015","unstructured":"Liu, L.: Cone avoiding closed sets. Trans. Am. Math. Soc. 367(3), 1609\u20131630 (2015). http:\/\/dx.org\/10.1090\/S0002-9947-2014-06049-2","journal-title":"Trans. Am. Math. Soc."},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-319-08019-2_33","volume-title":"Language, Life, Limits","author":"S Murakami","year":"2014","unstructured":"Murakami, S., Yamazaki, T., Yokoyama, K.: On the Ramseyan factorization theorem. In: Beckmann, A., Csuhaj-Varj\u00fa, E., Meer, K. (eds.) CiE 2014. LNCS, vol. 8493, pp. 324\u2013332. Springer, Heidelberg (2014)"},{"key":"36_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-319-20028-6_30","volume-title":"Evolving Computability","author":"L Patey","year":"2015","unstructured":"Patey, L.: Iterative forcing and hyperimmunity in reverse mathematics. In: Beckmann, A., Mitrana, V., Soskova, M. (eds.) CiE 2015. LNCS, vol. 9136, pp. 291\u2013301. Springer, Heidelberg (2015)"},{"key":"36_CR17","unstructured":"Patey, L.: The reverse mathematics of Ramsey-type theorems. Ph.D. thesis. Universit\u00e9 Paris Diderot (2016)"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Patey, L.: The weakness of being cohesive, thin or free in reverse mathematics. Isr. J. Math. (2016 to appear). http:\/\/arxiv.org\/abs\/1502.03709","DOI":"10.1007\/s11856-016-1433-3"},{"issue":"4","key":"36_CR19","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1305\/ndjfl\/1040136917","volume":"36","author":"D Seetapun","year":"1995","unstructured":"Seetapun, D., Slaman, T.A.: On the strength of Ramsey\u2019s theorem. Notre Dame J. Formal Logic 36(4), 570\u2013582 (1995)","journal-title":"Notre Dame J. Formal Logic"},{"key":"36_CR20","unstructured":"Steila, S., Yokoyama, K.: Reverse mathematical bounds for the termination theorem, to appear"}],"container-title":["Lecture Notes in Computer Science","Pursuit of the Universal"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40189-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T13:12:05Z","timestamp":1656681125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40189-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401881","9783319401898"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40189-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}