{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:40:37Z","timestamp":1777516837410,"version":"3.51.4"},"reference-count":34,"publisher":"SAGE Publications","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["COM"],"published-print":{"date-parts":[[2020,8,3]]},"DOI":"10.3233\/com-190251","type":"journal-article","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T12:19:45Z","timestamp":1587125985000},"page":"193-217","source":"Crossref","is-referenced-by-count":1,"title":["Some results concerning the SRT 2 2 vs. COH problem"],"prefix":"10.1177","volume":"9","author":[{"given":"Peter A.","family":"Cholak","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Notre Dame, IN, USA. Peter.Cholak.1@nd.edu"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damir D.","family":"Dzhafarov","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Connecticut, CT, USA. damir@math.uconn.edu"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis R.","family":"Hirschfeldt","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Chicago, IL, USA. drh@math.uchicago.edu"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludovic","family":"Patey","sequence":"additional","affiliation":[{"name":"Institut Camille Jordan, Universit\u00e9 Claude Bernard Lyon 1, France. ludovic.patey@computability.fr"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"6","key":"10.3233\/COM-190251_ref1","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1016\/j.apal.2016.11.010","article-title":"The uniform content of partial and linear orders","volume":"168","author":"Astor","year":"2017","journal-title":"Ann. Pure Appl. Logic"},{"issue":"4","key":"10.3233\/COM-190251_ref3","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1017\/jsl.2017.43","article-title":"On the uniform computational content of Ramsey\u2019s theorem","volume":"82","author":"Brattka","year":"2017","journal-title":"J. Symbolic Logic"},{"issue":"4","key":"10.3233\/COM-190251_ref4","first-page":"515","article-title":"A cohesive set which is not high","volume":"39","author":"Carl","year":"1993","journal-title":"Math. Logic Quart."},{"issue":"1","key":"10.3233\/COM-190251_ref5","doi-asserted-by":"publisher","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":"J. Symbolic Logic"},{"issue":"3","key":"10.3233\/COM-190251_ref6","doi-asserted-by":"publisher","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":"Proc. Amer. Math. Soc."},{"issue":"3","key":"10.3233\/COM-190251_ref7","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1090\/S0894-0347-2014-00789-X","article-title":"The metamathematics of stable Ramsey\u2019s theorem for pairs","volume":"27","author":"Chong","year":"2014","journal-title":"J. Amer. Math. Soc."},{"key":"10.3233\/COM-190251_ref8","doi-asserted-by":"crossref","unstructured":"Denis and R.\u00a0Hirschfeldt, Slicing the Truth: On the Computable and Reverse Mathematics of Combinatorial Principles, Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, World Scientific, Hackensack, NJ, 2014.","DOI":"10.1142\/9208"},{"key":"10.3233\/COM-190251_ref9","doi-asserted-by":"crossref","unstructured":"Denis, R.\u00a0Hirschfeldt, C.G.\u00a0Jockusch Jr., B.\u00a0Kjos-Hanssen, S.\u00a0Lempp and T.A.\u00a0Slaman, The strength of some combinatorial principles related to Ramsey\u2019s theorem for pairs, in: Computational Prospects of Infinity. Part II. Presented Talks, Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, Vol.\u00a015, World Scientific, Hackensack, NJ, 2008, pp.\u00a0143\u2013161.","DOI":"10.1142\/9789812796554_0008"},{"issue":"2","key":"10.3233\/COM-190251_ref10","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1090\/tran\/6465","article-title":"On uniform relationships between combinatorial problems","volume":"368","author":"Dorais","year":"2016","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.3233\/COM-190251_ref11","doi-asserted-by":"crossref","unstructured":"R.G.\u00a0Downey and D.R.\u00a0Hirschfeldt, Algorithmic Randomness and Complexity. Theory and Applications of Computability, Springer, New York, 2010.","DOI":"10.1007\/978-0-387-68441-3"},{"issue":"3","key":"10.3233\/COM-190251_ref12","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.2307\/2695113","article-title":"A \u0394 2 0 set with no infinite low subset in either it or its complement","volume":"66","author":"Downey","year":"2001","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"10.3233\/COM-190251_ref13","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1090\/S0002-9939-2014-12261-1","article-title":"Cohesive avoidance and strong reductions","volume":"143","author":"Dzhafarov","year":"2015","journal-title":"Proc. Amer. Math. Soc."},{"issue":"4","key":"10.3233\/COM-190251_ref14","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1017\/jsl.2016.1","article-title":"Strong reductions between combinatorial principles","volume":"81","author":"Dzhafarov","year":"2016","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"10.3233\/COM-190251_ref15","doi-asserted-by":"publisher","first-page":"557","DOI":"10.2178\/jsl\/1243948327","article-title":"Ramsey\u2019s theorem and cone avoidance","volume":"74","author":"Dzhafarov","year":"2009","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-190251_ref16","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.aim.2017.08.009","article-title":"Coloring trees in reverse mathematics","volume":"318","author":"Dzhafarov","year":"2017","journal-title":"Adv. Math."},{"issue":"3","key":"10.3233\/COM-190251_ref17","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1090\/proc\/13315","article-title":"Ramsey\u2019s theorem for singletons and strong computable reducibility","volume":"145","author":"Dzhafarov","year":"2017","journal-title":"Proc. Amer. Math. Soc."},{"issue":"4","key":"10.3233\/COM-190251_ref18","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.2178\/jsl.7704120","article-title":"Reverse mathematics and a Ramsey-type K\u00f6nig\u2019s lemma","volume":"77","author":"Flood","year":"2012","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-190251_ref19","doi-asserted-by":"publisher","DOI":"10.1142\/S0219061316500021"},{"issue":"1","key":"10.3233\/COM-190251_ref20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2178\/jsl\/1174668391","article-title":"Combinatorial principles weaker than Ramsey\u2019s theorem for pairs","volume":"72","author":"Hirschfeldt","year":"2007","journal-title":"J. Symbolic Logic"},{"key":"10.3233\/COM-190251_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50062-1_12"},{"issue":"7\u20138","key":"10.3233\/COM-190251_ref22","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s00153-019-00664-z","article-title":"Using Ramsey\u2019s theorem once","volume":"58","author":"Hirst","year":"2019","journal-title":"Arch. Math. Logic"},{"key":"10.3233\/COM-190251_ref23","doi-asserted-by":"publisher","DOI":"10.1142\/S0219061313500074"},{"issue":"2","key":"10.3233\/COM-190251_ref24","doi-asserted-by":"publisher","first-page":"609","DOI":"10.2178\/jsl\/1333566640","article-title":"RT 2 2 does not imply WKL 0","volume":"77","author":"Liu","year":"2012","journal-title":"J. Symbolic Logic"},{"issue":"1","key":"10.3233\/COM-190251_ref26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1215\/00294527-2018-0020","article-title":"\u03a0 1 0 -encodability and omniscient reductions","volume":"60","author":"Monin","year":"2019","journal-title":"Notre Dame J. Formal Logic"},{"issue":"2","key":"10.3233\/COM-190251_ref29","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1017\/bsl.2015.40","article-title":"Open questions about Ramsey-type statements in reverse mathematics","volume":"22","author":"Patey","year":"2016","journal-title":"Bull. Symb. Log."},{"key":"10.3233\/COM-190251_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40189-8_36"},{"issue":"4","key":"10.3233\/COM-190251_ref31","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1017\/jsl.2015.80","article-title":"The strength of the tree theorem for pairs in reverse mathematics","volume":"81","author":"Patey","year":"2016","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"10.3233\/COM-190251_ref33","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/s11856-016-1433-3","article-title":"The weakness of being cohesive, thin or free in reverse mathematics","volume":"216","author":"Patey","year":"2016","journal-title":"Israel J. Math."},{"issue":"3","key":"10.3233\/COM-190251_ref34","doi-asserted-by":"publisher","first-page":"209","DOI":"10.3233\/COM-160062","article-title":"Iterative forcing and hyperimmunity in reverse mathematics","volume":"6","author":"Patey","year":"2017","journal-title":"Computability"},{"issue":"4","key":"10.3233\/COM-190251_ref36","doi-asserted-by":"publisher","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 J. Formal Logic"},{"key":"10.3233\/COM-190251_ref37","doi-asserted-by":"publisher","DOI":"10.1142\/9789814699952_0002"},{"key":"10.3233\/COM-190251_ref38","doi-asserted-by":"crossref","unstructured":"S.G.\u00a0Simpson, Subsystems of Second Order Arithmetic. Perspectives in Logic, 2nd edn, Cambridge University Press, Cambridge, 2009.","DOI":"10.1017\/CBO9780511581007"},{"key":"10.3233\/COM-190251_ref39","doi-asserted-by":"crossref","unstructured":"R.I.\u00a0Soare, Turing Computability: Theory and Applications, Springer, Berlin, 2016.","DOI":"10.1007\/978-3-642-31933-4"},{"issue":"4","key":"10.3233\/COM-190251_ref40","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1017\/jsl.2016.10","article-title":"The definability strength of combinatorial principles","volume":"81","author":"Wei","year":"2016","journal-title":"J. Symbolic Logic"}],"container-title":["Computability"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/COM-190251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:00:15Z","timestamp":1777392015000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-190251"}},"subtitle":[],"editor":[{"given":"Vasco","family":"Brattka","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Damir D.","family":"Dzhafarov","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Alberto","family":"Marcone","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Arno","family":"Pauly","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,8,3]]},"references-count":34,"journal-issue":{"issue":"3-4"},"URL":"https:\/\/doi.org\/10.3233\/com-190251","relation":{},"ISSN":["2211-3576","2211-3568"],"issn-type":[{"value":"2211-3576","type":"electronic"},{"value":"2211-3568","type":"print"}],"subject":[],"published":{"date-parts":[[2020,8,3]]}}}