{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:10:32Z","timestamp":1706649032493},"reference-count":24,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2011,1,1]]},"DOI":"10.1215\/00294527-2010-039","type":"journal-article","created":{"date-parts":[[2010,12,13]],"date-time":"2010-12-13T14:13:53Z","timestamp":1292249633000},"source":"Crossref","is-referenced-by-count":4,"title":["Stable Ramsey's Theorem and Measure"],"prefix":"10.1215","volume":"52","author":[{"given":"Damir D.","family":"Dzhafarov","sequence":"first","affiliation":[]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Ambos-Spies, K., B. Kjos-Hanssen, S. Lempp, and T. A. Slaman, \"Comparing DNR\" and WWKL, <i>The Journal of Symbolic Logic<\/i>, vol. 69 (2004), pp. 1089--1104.","DOI":"10.2178\/jsl\/1102022212"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Binns, S., and S. G. Simpson, \"Embeddings into the Medvedev and Muchnik lattices of $\\Pi^0_1$\" classes, <i>Archive for Mathematical Logic<\/i>, vol. 43 (2004), pp. 399--414.","DOI":"10.1007\/s00153-003-0195-x"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Downey, R., D. R. Hirschfeldt, S. Lempp, and R. Solomon, \"A $\\Delta^0_2$\" set with no infinite low subset in either it or its complement, <i>The Journal of Symbolic Logic<\/i>, vol. 66 (2001), pp. 1371--81.","DOI":"10.2307\/2695113"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] Downey, R., D. R. Hirschfeldt, J. S. Miller, and A. Nies, \"Relativizing Chaitin's halting probability\", <i>Journal of Mathematical Logic<\/i>, vol. 5 (2005), pp. 167--92.","DOI":"10.1142\/S0219061305000468"},{"key":"7","unstructured":"[7] Dzhafarov, D. D., <i>Reverse Mathematics of Combinatorial Principles<\/i>, Ph.D. thesis, University of Chicago. In preparation."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Hirschfeldt, D. R., C. G. Jockusch, Jr., B. Kjos-Hanssen, S. Lempp, and T. A. Slaman, \"The strength of some combinatorial principles related to Ramsey's theorem for pairs\", pp. 143--61 in <i>Computational Prospects of Infinity. Part II<\/i>. Presented Talks, edited by C. Chong et al., vol. 15 of <i>Lecture Notes Series. Institute for Mathematical Sciences. National University of Singapore<\/i>, World Scientific Publishing, Hackensack, 2008.","DOI":"10.1142\/9789812796554_0008"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Hirschfeldt, D. R., and S. A. Terwijn, \"Limit computability and constructive measure\", pp. 131--41 in <i>Computational Prospects of Infinity. Part II<\/i>. Presented Talks, edited by C. Chong et al., vol. 15 of <i>Lecture Notes Series. Institute for Mathematical Sciences. National University of Singapore<\/i>, World Scientific Publishing, Hackensack, 2008.","DOI":"10.1142\/9789812796554_0007"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Jockusch, C., and F. Stephan, \"A cohesive set which is not high\", <i>Mathematical Logic Quarterly<\/i>, vol. 39 (1993), pp. 515--30.","DOI":"10.1002\/malq.19930390153"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Jockusch, C. G., Jr., \"Ramsey's theorem and recursion theory\", <i>The Journal of Symbolic Logic<\/i>, vol. 37 (1972), pp. 268--80.","DOI":"10.2307\/2272972"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Jockusch, C. G., Jr., \"Degrees of functions with no fixed points\", pp. 191--201 in <i>Logic, Methodology and Philosophy of Science, VIII<\/i> (Moscow, 1987), vol. 126 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1989.","DOI":"10.1016\/S0049-237X(08)70045-4"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] Ku\u010dera, A., \"Measure, $\\Pi^0_1$\"-classes and complete extensions of ${\\rm PA}$, pp. 245--59 in <i>Recursion Theory Week (Oberwolfach, 1984)<\/i>, vol. 1141 of <i>Lecture Notes in Mathematics<\/i>, Springer, Berlin, 1985.","DOI":"10.1007\/BFb0076224"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] Schnorr, C.-P., <i>Zuf\u00e4lligkeit und Wahrscheinlichkeit. Eine algorithmische Begr\u00fcndung der Wahrscheinlichkeitstheorie<\/i>, vol. 218 of <i>Lecture Notes in Mathematics<\/i>, Springer-Verlag, Berlin, 1971.","DOI":"10.1007\/BFb0112460"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] Simpson, S. G., \"Degrees of unsolvability: A survey of results\", pp. 631--52 in <i>Handbook of Mathematical Logic<\/i>, edited by J. Barwise, vol. 90 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland Publishing Co., Amsterdam, 1977.","DOI":"10.1016\/S0049-237X(08)71117-0"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] Simpson, S. G., <i>Subsystems of Second Order Arithmetic<\/i>, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1999.","DOI":"10.1007\/978-3-642-59971-2"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] Stephan, F., \"Marin-L\u00f6f random and PA\"-complete sets, pp. 342--48 in <i>Logic Colloquium '02<\/i>, vol. 27 of <i>Lecture Notes in Logic<\/i>, Association for Symbolic Logic, La Jolla, 2006.","DOI":"10.1017\/9781316755723.016"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] Terwijn, S. A., \"On the quantitative structure of $\\Delta_2^0$\", pp. 271--83 in <i>Reuniting the Antipodes---Constructive and Nonstandard Views of the Continuum (Venice, 1999)<\/i>, vol. 306 of <i>Synthese Library<\/i>, Kluwer Academic Publishers, Dordrecht, 2001.","DOI":"10.1007\/978-94-015-9757-9_23"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] Yu, X., and S. G. Simpson, \"Measure theory and weak K\u00f6nig's lemma\", <i>Archive for Mathematical Logic<\/i>, vol. 30 (1990), pp. 171--80.","DOI":"10.1007\/BF01621469"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Cholak, P. A., C. G. Jockusch, and T. A. Slaman, \"On the strength of Ramsey's theorem for pairs\", <i>The Journal of Symbolic Logic<\/i>, vol. 66 (2001), pp. 1--55.","DOI":"10.2307\/2694910"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] Downey, R. G., and D. R. Hirschfeldt, <i>Algorithmic Randomness and Complexity<\/i>, Theory and Applications of Computability. Springer-Verlag, Berlin, 2010.","DOI":"10.1007\/978-0-387-68441-3"},{"key":"13","unstructured":"[13] Kjos-Hanssen, B., \"A strong law of computationally weak subsets\", Preprint. http:\/\/eccc.hpi-web.de\/report\/2010\/150\/."},{"key":"14","unstructured":"[14] Kjos-Hanssen, B., Section 7 of <i>Computability, Reverse Mathematics, and Combinatorics: Open Problems<\/i>, Banff International Research Station (BIRS), Alberta, 2009. http:\/\/www.birs.ca\/events\/2008\/5-day-workshops\/08w5019."},{"key":"16","unstructured":"[16] Mileti, J. R., <i>Partition Theorems and Computability Theory<\/i>, Ph.D. thesis, University of Illinois at Urbana-Champaign, 2004."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] Soare, R. I., <i>Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets<\/i>, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987.","DOI":"10.1007\/978-3-662-02460-7"},{"key":"22","unstructured":"[22] Terwijn, S. A., <i>Computability and Measure<\/i>, Ph.D. thesis, Institute for Logic, Language, and Computation, Amsterdam, 1998."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2010-039","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:38Z","timestamp":1706648258000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-52\/issue-1\/Stable-Ramseys-Theorem-and-Measure\/10.1215\/00294527-2010-039.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":24,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2010-039","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}