{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T08:59:29Z","timestamp":1775465969855,"version":"3.50.1"},"reference-count":29,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2019,1,1]]},"DOI":"10.1215\/00294527-2018-0020","type":"journal-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T09:06:13Z","timestamp":1547802373000},"source":"Crossref","is-referenced-by-count":4,"title":["\u03a010-Encodability and Omniscient Reductions"],"prefix":"10.1215","volume":"60","author":[{"given":"Benoit","family":"Monin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludovic","family":"Patey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Cholak, P. A., C. G. Jockusch, Jr., and T. A. Slaman, \u201cOn the strength of Ramsey\u2019s theorem for pairs,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 66 (2001), pp. 1\u201355.","DOI":"10.2307\/2694910"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Downey, R. G., and D. R. Hirschfeldt, <i>Algorithmic Randomness and Complexity<\/i>, Springer, New York, 2010.","DOI":"10.1007\/978-0-387-68441-3"},{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Brattka, V., and T. Rakotoniaina, \u201cOn the uniform computational content of Ramsey\u2019s theorem,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 82 (2017), pp. 1278\u2013316.","DOI":"10.1017\/jsl.2017.43"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Chong, C. T., and L. Yu, <i>Recursion Theory: Computational Aspects of Definability<\/i>, vol. 8 of <i>De Gruyter Series in Logic and its Applications<\/i>, De Gruyter, Berlin, 2015.","DOI":"10.1515\/9783110275643"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Dorais, F. G., D. D. Dzhafarov, J. L. Hirst, J. R. Mileti, and P. Shafer, \u201cOn uniform relationships between combinatorial problems,\u201d <i>Transactions of the American Mathematical Society<\/i>, vol. 368 (2016), pp. 1321\u201359.","DOI":"10.1090\/tran\/6465"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Dzhafarov, D. D., and C. G. Jockusch, Jr., \u201cRamsey\u2019s theorem and cone avoidance,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 74 (2009), pp. 557\u201378.","DOI":"10.2178\/jsl\/1243948327"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Dzhafarov, D. D., L. Patey, D. R. Solomon, and L. B. Westrick, \u201cRamsey\u2019s theorem for singletons and strong computable reducibility,\u201d <i>Proceedings of the American Mathematical Society<\/i>, vol. 145 (2017), pp. 1343\u201355.","DOI":"10.1090\/proc\/13315"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Galvin, F., and K. Prikry, \u201cBorel sets and Ramsey\u2019s theorem,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 38 (1973), pp. 193\u201398.","DOI":"10.2307\/2272055"},{"key":"9","unstructured":"[9] Gandy, R. O., G. Kreisel, and W. W. Tait, \u201cSet existence,\u201d <i>Bulletin L\u2019Acad\u00e9mie Polonaise des Science, S\u00e9rie des Sciences Math\u00e9matiques, Astronomiques et Physiques<\/i>, vol. 8 (1960), pp. 577\u201382."},{"key":"10","unstructured":"[10] Groszek, M. J., and T. A. Slaman, \u201cModuli of computation,\u201d conference lecture on <i>Logic, Computability and Randomness<\/i>, Buenos Aires, Argentina, 2007."},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Hinman, P. G., \u201cA survey of Mu\u010dnik and Medvedev degrees,\u201d <i>Bulletin of Symbolic Logic<\/i>, vol. 18 (2012), pp. 161\u2013229.","DOI":"10.2178\/bsl\/1333560805"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Hirschfeldt, D. R., and C. G. Jockusch, Jr., \u201cOn notions of computability-theoretic reduction between $\\Pi^{1}_{2}$ principles,\u201d <i>Journal of Mathematical Logic<\/i>, vol. 16 (2016), no. 1, art. ID 1650002.","DOI":"10.1142\/S0219061316500021"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Hirschfeldt, D. R., C. G. Jockusch, Jr., B. Kjos-Hanssen, S. Lempp, and T. A. Slaman, \u201cThe strength of some combinatorial principles related to Ramsey\u2019s theorem for pairs,\u201d pp. 143\u201361 in <i>Computational Prospects of Infinity, Part II: Presented Talks<\/i>, vol. 15 of <i>Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore<\/i>, World Scientific, Hackensack, NJ, 2008.","DOI":"10.1142\/9789812796554_0008"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] Jockusch, C. G., Jr., \u201cRamsey\u2019s theorem and recursion theory,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 37 (1972), pp. 268\u201380.","DOI":"10.2307\/2272972"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] Jockusch, C. G., Jr., and R. I. Soare, \u201c$\\Pi^{0}_{1}$ classes and degrees of theories,\u201d <i>Transactions of the American Mathematical Society<\/i>, vol. 173 (1972), pp. 33\u201356.","DOI":"10.2307\/1996261"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] Jockusch, C. G., Jr., and R. I. Soare, \u201cEncodability of Kleene\u2019s $O$, <i>Journal of Symbolic Logic<\/i>, vol. 38 (1973), pp. 437\u201340.","DOI":"10.2307\/2273040"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] Montalb\u00e1n, A., \u201cOpen questions in reverse mathematics,\u201d <i>Bulletin of Symbolic Logic<\/i>, vol. 17 (2011), pp. 431\u201354.","DOI":"10.2178\/bsl\/1309952320"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] Moschovakis, Y. N., <i>Descriptive Set Theory<\/i>, 2nd edition, vol. 155 of <i>Mathematical Surveys and Monographs<\/i>, American Mathematical Society, Providence, 2009.","DOI":"10.1090\/surv\/155"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] Nies, A., <i>Computability and Randomness<\/i>, vol. 51 of <i>Oxford Logic Guides<\/i>, Oxford University Press, Oxford, 2009.","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] Patey, L., \u201cThe weakness of being cohesive, thin or free in reverse mathematics,\u201d <i>Israel Journal of Mathematics<\/i>, vol. 216 (2016), pp. 905\u201355.","DOI":"10.1007\/s11856-016-1433-3"},{"key":"21","unstructured":"[21] Sacks, G. E., <i>Degrees of Unsolvability<\/i>, vol. 55 of <i>Annals of Mathematics Studies<\/i>, Princeton University Press, Princeton, 1963."},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] Sacks, G. E., <i>Higher Recursion Theory<\/i>, <i>Perspectives in Mathematical Logic<\/i>, Springer, Berlin, 1990.","DOI":"10.1007\/978-3-662-12013-2"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] Seetapun, D., and T. A. Slaman, \u201cOn the strength of Ramsey\u2019s theorem,\u201d <i>Notre Dame Journal of Formal Logic<\/i>, vol. 36 (1995), pp. 570\u201382.","DOI":"10.1305\/ndjfl\/1040136917"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] Shore, R. A., \u201cReverse mathematics: The playground of logic,\u201d <i>Bulletin of Symbolic Logic<\/i>, vol. 16 (2010), pp. 378\u2013402.","DOI":"10.2178\/bsl\/1286284559"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] Silver, J., \u201cEvery analytic set is Ramsey,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 35 (1970), pp. 60\u201364.","DOI":"10.1017\/S0022481200092239"},{"key":"26","unstructured":"[26] Simpson, S. G., <i>Subsystems of Second Order Arithmetic<\/i>, 2nd edition, <i>Perspectives in Logic<\/i>, Cambridge University Press, Cambridge, 2009."},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] Soare, R. I., \u201cSets with no subset of higher degree,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 34 (1969), pp. 53\u201356.","DOI":"10.2307\/2270981"},{"key":"28","doi-asserted-by":"publisher","unstructured":"[28] Solovay, R. M., \u201cHyperarithmetically encodable sets,\u201d <i>Transactions of the American Mathematical Society<\/i>, vol. 239 (1978), pp. 99\u2013122.","DOI":"10.1090\/S0002-9947-1978-0491103-7"},{"key":"29","doi-asserted-by":"publisher","unstructured":"[29] Spector, C., \u201cRecursive well-orderings,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 20 (1955), pp. 151\u201363.","DOI":"10.2307\/2266902"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2018-0020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:59:39Z","timestamp":1706648379000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-60\/issue-1\/%ce%a010-Encodability-and-Omniscient-Reductions\/10.1215\/00294527-2018-0020.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2018-0020","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}