{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:13Z","timestamp":1760202613751},"reference-count":22,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2010,1,1]]},"DOI":"10.1215\/00294527-2010-009","type":"journal-article","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T20:39:47Z","timestamp":1273005587000},"source":"Crossref","is-referenced-by-count":8,"title":["\u03a0 1 0 Classes, Peano Arithmetic, Randomness, and Computable Domination"],"prefix":"10.1215","volume":"51","author":[{"given":"David E.","family":"Diamondstone","sequence":"first","affiliation":[]},{"given":"Damir D.","family":"Dzhafarov","sequence":"additional","affiliation":[]},{"given":"Robert I.","family":"Soare","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Cenzer, D., \"$\\Pi^0_1$ classes in computability theory\", pp. 37--85 in <i>Handbook of Computability Theory<\/i>, edited by E. R. Griffor, vol. 140 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1999.","DOI":"10.1016\/S0049-237X(99)80018-4"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Cenzer, D., P. Clote, R. L. Smith, R. I. Soare, and S. S. Wainer, \"Members of countable $\\Pi^0_1$ classes\", <i>Annals of Pure and Applied Logic<\/i>, vol. 31 (1986), pp. 145--63. Special issue: Second Southeast Asian logic conference (Bangkok, 1984).","DOI":"10.1016\/0168-0072(86)90067-9"},{"key":"3","unstructured":"[3] Cooper, S. B., <i>Computability Theory<\/i>, Chapman &amp; Hall\/CRC Mathematics, Boca Raton, 2004."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Dekker, J. C. E., \"A theorem on hypersimple sets\", <i>Proceedings of the American Mathematical Society<\/i>, vol. 5 (1954), pp. 791--96.","DOI":"10.1090\/S0002-9939-1954-0063995-6"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Dzhafarov, D. D., and C. G. Jockusch, Jr., \"Ramsey's theorem and cone avoidance\", <i>The Journal of Symbolic Logic<\/i>, vol. 74 (2009), pp. 557--78.","DOI":"10.2178\/jsl\/1243948327"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] 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), edited by J. E. Fenstad, I. T. Frolov, and R. Hilpinen, 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":"8","doi-asserted-by":"publisher","unstructured":"[8] Jockusch, C. G., Jr., and R. I. Soare, \"A minimal pair of $\\Pi _{1}^{0}$ classes\", <i>The Journal of Symbolic Logic<\/i>, vol. 36 (1971), pp. 66--78.","DOI":"10.2307\/2271516"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Jockusch, C. G., Jr., and R. I. Soare, \"Degrees of members of $\\Pi ^{0}_{1}$ classes\", <i>Pacific Journal of Mathematics<\/i>, vol. 40 (1972), pp. 605--16.","DOI":"10.2140\/pjm.1972.40.605"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Jockusch, C. G., Jr., and R. I. Soare, \"$\\Pi ^{0}_{1}$ classes and degrees of theories\", <i>Transactions of the American Mathematical Society<\/i>, vol. 173 (1972), pp. 33--56.","DOI":"10.2307\/1996261"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Kjos-Hanssen, B., A. Nies, and F. Stephan, \"Lowness for the class of Schnorr random reals\", <i>SIAM<\/i> Journal on Computing, vol. 35 (2005), pp. 647--57.","DOI":"10.1137\/S0097539704446323"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Ku\u010dera, A., \"On the use of diagonally nonrecursive functions\", pp. 219--39 in <i>Logic Colloquium '87 (Granada, 1987)<\/i>, vol. 129 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1989.","DOI":"10.1016\/S0049-237X(08)70130-7"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] Miller, W., and D. A. Martin, \"The degrees of hyperimmune sets\", <i>Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik<\/i>, vol. 14 (1968), pp. 159--66.","DOI":"10.1002\/malq.19680140704"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] 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":"17","doi-asserted-by":"publisher","unstructured":"[17] Nies, A., F. Stephan, and S. A. Terwijn, \"Randomness, relativization and Turing degrees\", <i>The Journal of Symbolic Logic<\/i>, vol. 70 (2005), pp. 515--35.","DOI":"10.2178\/jsl\/1120224726"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] Post, E. L., \"Recursively enumerable sets of positive integers and their decision problems\", <i>Bulletin of the American Mathematical Society<\/i>, vol. 50 (1944), pp. 284--316.","DOI":"10.1090\/S0002-9904-1944-08111-1"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] Scott, D. S., \"Algebras of sets binumerable in complete extensions of arithmetic\", pp. 117--21 in <i>Proceedings of Symposia in Pure Mathematics, Vol. V<\/i>, American Mathematical Society, Providence, 1962.","DOI":"10.1090\/pspum\/005\/0141595"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] Shoenfield, J. R., \"Degrees of models\", <i>The Journal of Symbolic Logic<\/i>, vol. 25 (1960), pp. 233--37.","DOI":"10.2307\/2964680"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] 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":"5","doi-asserted-by":"crossref","unstructured":"[5] Downey, R., and D. R. Hirschfeldt, <i>Algorithmic Randomness and Complexity<\/i>, Springer-Verlag, Heidelberg, 2010.","DOI":"10.1007\/978-0-387-68441-3"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Ku\u010dera, A., \"An alternative, priority-free, solution to Post's problem\", pp. 493--500 in <i>Mathematical Foundations of Computer Science, 1986 (Bratislava, 1986)<\/i>, vol. 233 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 1986.","DOI":"10.1007\/BFb0016275"},{"key":"14","unstructured":"[14] Lewis, A. E. M., and T. F. Kent, \"On the degree spectrum of a $\\pi^0_1$ class\", forthcoming in <i>Transactions of the American Mathematical Society<\/i>."},{"key":"21","unstructured":"[21] Soare, R. I., <i>Computability Theory and Applications<\/i>, Springer-Verlag, Heidelberg. In preparation. Available in PDF form."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2010-009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:26Z","timestamp":1706648246000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-51\/issue-1\/%ce%a0-1-0-Classes-Peano-Arithmetic-Randomness-and-Computable-Domination\/10.1215\/00294527-2010-009.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,1]]},"references-count":22,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2010,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2010-009","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2010,1,1]]}}}