{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T02:54:10Z","timestamp":1785984850276,"version":"3.56.0"},"reference-count":45,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Math. Log."],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p> Several notions of computability-theoretic reducibility between [Formula: see text] principles have been studied. This paper contributes to the program of analyzing the behavior of versions of Ramsey\u2019s Theorem and related principles under these notions. Among other results, we show that for each [Formula: see text], there is an instance of RT[Formula: see text] all of whose solutions have PA degree over [Formula: see text] and use this to show that K\u00f6nig\u2019s Lemma lies strictly between RT[Formula: see text] and RT[Formula: see text] under one of these notions. We also answer two questions raised by Dorais, Dzhafarov, Hirst, Mileti, and Shafer (2016) on comparing versions of Ramsey\u2019s Theorem and of the Thin Set Theorem with the same exponent but different numbers of colors. Still on the topic of the effect of the number of colors on the computable aspects of Ramsey-theoretic properties, we show that for each [Formula: see text], there is an [Formula: see text]-coloring [Formula: see text] of [Formula: see text] such that every [Formula: see text]-coloring of [Formula: see text] has an infinite homogeneous set that does not compute any infinite homogeneous set for [Formula: see text], and connect this result with the notion of infinite information reducibility introduced by Dzhafarov and Igusa (to appear). Next, we introduce and study a new notion that provides a uniform version of the idea of implication with respect to [Formula: see text]-models of RCA<jats:sub>0<\/jats:sub>, and related notions that allow us to count how many applications of a principle [Formula: see text] are needed to reduce another principle to [Formula: see text]. Finally, we fill in a gap in the proof of Theorem 12.2 in Cholak, Jockusch, and Slaman (2001). <\/jats:p>","DOI":"10.1142\/s0219061316500021","type":"journal-article","created":{"date-parts":[[2016,5,27]],"date-time":"2016-05-27T06:13:03Z","timestamp":1464329583000},"page":"1650002","source":"Crossref","is-referenced-by-count":25,"title":["On notions of computability-theoretic reduction between \u03a021 principles"],"prefix":"10.1142","volume":"16","author":[{"given":"Denis R.","family":"Hirschfeldt","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Chicago, 5734 S. University Ave., Chicago, IL 60637, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"suffix":"Jr.","given":"Carl G.","family":"Jockusch","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Illinois at Urbana-Champaign, 1409 W. Green Street, Urbana, IL 61801, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2016,7,4]]},"reference":[{"key":"S0219061316500021BIB001","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1102022212"},{"key":"S0219061316500021BIB002","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1294186663"},{"key":"S0219061316500021BIB003","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1294170993"},{"key":"S0219061316500021BIB006","series-title":"Lecture Notes in Logic","first-page":"104","volume-title":"Reverse Mathematics 2001","volume":"21","author":"Cholak P. A.","year":"2005"},{"key":"S0219061316500021BIB007","doi-asserted-by":"publisher","DOI":"10.2307\/2694910"},{"key":"S0219061316500021BIB008","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1254748700"},{"key":"S0219061316500021BIB009","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-09-10115-6"},{"key":"S0219061316500021BIB010","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-2014-00789-X"},{"key":"S0219061316500021BIB011","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1254748693"},{"key":"S0219061316500021BIB012","doi-asserted-by":"publisher","DOI":"10.1090\/tran\/6465"},{"key":"S0219061316500021BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3"},{"key":"S0219061316500021BIB015","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-2014-12261-1"},{"key":"S0219061316500021BIB018","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1243948327"},{"key":"S0219061316500021BIB020","doi-asserted-by":"publisher","DOI":"10.2307\/2964177"},{"key":"S0219061316500021BIB022","doi-asserted-by":"publisher","DOI":"10.1215\/00294527-2009-018"},{"key":"S0219061316500021BIB023","doi-asserted-by":"publisher","DOI":"10.2307\/2586708"},{"key":"S0219061316500021BIB024","series-title":"Oxford Logic Guides","first-page":"185","volume-title":"Arithmetic, Proof Theory, and Computational Complexity","volume":"23","author":"H\u00e1jek P.","year":"1993"},{"key":"S0219061316500021BIB025","doi-asserted-by":"publisher","DOI":"10.1142\/9208"},{"key":"S0219061316500021BIB026","doi-asserted-by":"publisher","DOI":"10.1142\/9789812796554_0008"},{"key":"S0219061316500021BIB028","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1174668391"},{"key":"S0219061316500021BIB029","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-09-04847-8"},{"key":"S0219061316500021BIB030","doi-asserted-by":"publisher","DOI":"10.2307\/2272972"},{"key":"S0219061316500021BIB031","doi-asserted-by":"publisher","DOI":"10.2307\/2274710"},{"key":"S0219061316500021BIB032","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1969.30.67"},{"key":"S0219061316500021BIB033","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/jdr051"},{"key":"S0219061316500021BIB034","first-page":"33","volume":"173","author":"Jockusch C. G.","year":"1972","journal-title":"Trans. Amer. Math. Soc."},{"key":"S0219061316500021BIB035","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1972.40.605"},{"key":"S0219061316500021BIB036","doi-asserted-by":"publisher","DOI":"10.2307\/1969708"},{"key":"S0219061316500021BIB037","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0076224"},{"key":"S0219061316500021BIB038","doi-asserted-by":"publisher","DOI":"10.2307\/2273469"},{"key":"S0219061316500021BIB039","first-page":"1108","volume":"239","author":"Lacombe D.","year":"1954","journal-title":"C. R. Acad. Sci."},{"key":"S0219061316500021BIB040","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1333566640"},{"key":"S0219061316500021BIB043","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1309952320"},{"key":"S0219061316500021BIB044","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers","volume":"125","author":"Odifreddi P.","year":"1989"},{"key":"S0219061316500021BIB047","doi-asserted-by":"publisher","DOI":"10.2307\/2273221"},{"key":"S0219061316500021BIB049","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12013-2"},{"key":"S0219061316500021BIB051","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1040136917"},{"key":"S0219061316500021BIB052","doi-asserted-by":"publisher","DOI":"10.2178\/bsl\/1286284559"},{"key":"S0219061316500021BIB053","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59971-2"},{"key":"S0219061316500021BIB054","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581007"},{"key":"S0219061316500021BIB055","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"},{"key":"S0219061316500021BIB056","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1978-0491103-7"},{"key":"S0219061316500021BIB057","doi-asserted-by":"publisher","DOI":"10.2307\/1969604"},{"key":"S0219061316500021BIB058","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2014.05.003"},{"key":"S0219061316500021BIB061","doi-asserted-by":"publisher","DOI":"10.1007\/BF01621469"}],"container-title":["Journal of Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219061316500021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:59:30Z","timestamp":1565146770000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219061316500021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":45,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2016,7,4]]},"published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1142\/S0219061316500021"],"URL":"https:\/\/doi.org\/10.1142\/s0219061316500021","relation":{},"ISSN":["0219-0613","1793-6691"],"issn-type":[{"value":"0219-0613","type":"print"},{"value":"1793-6691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}