{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:38:57Z","timestamp":1777516737514,"version":"3.51.4"},"reference-count":17,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["COM"],"published-print":{"date-parts":[[2016,12,22]]},"DOI":"10.3233\/com-160056","type":"journal-article","created":{"date-parts":[[2016,12,23]],"date-time":"2016-12-23T21:38:34Z","timestamp":1482529114000},"page":"47-78","source":"Crossref","is-referenced-by-count":3,"title":["Controlling iterated jumps of solutions to combinatorial problems"],"prefix":"10.1177","volume":"6","author":[{"given":"Ludovic","family":"Patey","sequence":"first","affiliation":[{"name":"Laboratoire PPS, Universit\u00e9 Paris Diderot, Paris, France. ludovic.patey@computability.fr."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/COM-160056_ref2","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.4153\/CJM-1972-113-9","article-title":"Degrees in which the recursive sets are uniformly recursive","volume":"24","author":"Jockusch","year":"1972","journal-title":"Canad. J. Math."},{"issue":"2","key":"10.3233\/COM-160056_ref3","doi-asserted-by":"crossref","first-page":"268","DOI":"10.2307\/2272972","article-title":"Ramsey\u2019s theorem and recursion theory","volume":"37","author":"Jockusch","year":"1972","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"10.3233\/COM-160056_ref4","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1002\/malq.19930390153","article-title":"A cohesive set which is not high","volume":"39","author":"Jockusch","year":"1993","journal-title":"Mathematical Logic Quarterly"},{"issue":"9","key":"10.3233\/COM-160056_ref5","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1016\/j.apal.2014.04.011","article-title":"Generics for computable Mathias forcing","volume":"165","author":"Cholak","year":"2014","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.3233\/COM-160056_ref6","first-page":"104","article-title":"Free sets and reverse mathematics","volume":"21","author":"Cholak","year":"2001","journal-title":"Reverse Mathematics"},{"issue":"01","key":"10.3233\/COM-160056_ref7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2694910","article-title":"On the strength of Ramsey\u2019s theorem for pairs","volume":"66","author":"Cholak","year":"2001","journal-title":"Journal of Symbolic Logic"},{"issue":"3","key":"10.3233\/COM-160056_ref8","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1090\/S0002-9939-09-10115-6","article-title":"On the role of the collection principle for \u03a3 2 0 -formulas in second-order reverse mathematics","volume":"138","author":"Chong","year":"2010","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"04","key":"10.3233\/COM-160056_ref9","doi-asserted-by":"crossref","first-page":"1310","DOI":"10.2178\/jsl\/1254748693","article-title":"The strength of the rainbow Ramsey theorem","volume":"74","author":"Csima","year":"2009","journal-title":"Journal of Symbolic Logic"},{"key":"10.3233\/COM-160056_ref10","doi-asserted-by":"crossref","unstructured":"D.R.\u00a0Hirschfeldt, Slicing the Truth: On the Computable and Reverse Mathematics of Combinatorial Principles, C.\u00a0Chong, Q.\u00a0Feng, T.A.\u00a0Slaman, W.H.\u00a0Woodin and Y.\u00a0Yang, eds, Lecture Notes Series. Institute for Mathematical Sciences. National University of Singapore, Vol.\u00a028, World Scientific Publishing Co. Pte. Ltd, Hackensack, NJ, 2015.","DOI":"10.1017\/bsl.2015.18"},{"issue":"2","key":"10.3233\/COM-160056_ref11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1215\/00294527-1715716","article-title":"Primitive recursion and the chain antichain principle","volume":"53","author":"Kreuzer","year":"2012","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"10.3233\/COM-160056_ref12","doi-asserted-by":"crossref","unstructured":"M.\u00a0Lerman, R.\u00a0Solomon and H.\u00a0Towsner, Separating principles below Ramsey\u2019s theorem for pairs, Journal of Mathematical Logic 13(02) (2013), 1350007.","DOI":"10.1142\/S0219061313500074"},{"issue":"11","key":"10.3233\/COM-160056_ref14","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1016\/j.apal.2015.07.003","article-title":"Degrees bounding principles and universal instances in reverse mathematics","volume":"166","author":"Patey","year":"2015","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.3233\/COM-160056_ref15","doi-asserted-by":"crossref","unstructured":"L.\u00a0Patey, Iterative forcing and hyperimmunity in reverse mathematics, in: Evolving Computability (CiE), A.\u00a0Beckmann, V.\u00a0Mitrana and M.\u00a0Soskova, eds, Lecture Notes in Computer Science, Vol.\u00a09136, Springer International Publishing, 2015, pp.\u00a0291\u2013301.","DOI":"10.1007\/978-3-319-20028-6_30"},{"issue":"4","key":"10.3233\/COM-160056_ref18","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1305\/ndjfl\/1040136917","article-title":"On the strength of Ramsey\u2019s theorem","volume":"36","author":"Seetapun","year":"1995","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"10.3233\/COM-160056_ref19","doi-asserted-by":"crossref","unstructured":"S.G.\u00a0Simpson, Subsystems of Second Order Arithmetic, Cambridge University Press, 2009.","DOI":"10.1017\/CBO9780511581007"},{"issue":"2","key":"10.3233\/COM-160056_ref20","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.apal.2013.06.002","article-title":"Cohesive sets and rainbows","volume":"165","author":"Wang","year":"2014","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.3233\/COM-160056_ref21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.aim.2014.05.003","article-title":"Some logically weak Ramseyan theorems","volume":"261","author":"Wang","year":"2014","journal-title":"Advances in Mathematics"}],"container-title":["Computability"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/COM-160056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T15:59:50Z","timestamp":1777391990000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-160056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,22]]},"references-count":17,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/com-160056","relation":{},"ISSN":["2211-3576","2211-3568"],"issn-type":[{"value":"2211-3576","type":"electronic"},{"value":"2211-3568","type":"print"}],"subject":[],"published":{"date-parts":[[2016,12,22]]}}}