{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T00:13:18Z","timestamp":1706659998610},"reference-count":21,"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-0024","type":"journal-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T09:06:13Z","timestamp":1547802373000},"source":"Crossref","is-referenced-by-count":0,"title":["Levels of Uniformity"],"prefix":"10.1215","volume":"60","author":[{"given":"Rutger","family":"Kuyper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Downey, R. G., and D. R. Hirschfeldt, <i>Algorithmic Randomness and Complexity<\/i>, Theory and Applications of Computability, Springer, New York, 2010.","DOI":"10.1007\/978-0-387-68441-3"},{"key":"2","unstructured":"[2] Dyment, E. Z., \u201cCertain properties of the Medvedev lattice,\u201d <i>Matematicheskii Sbornik, (NS)<\/i>, vol. 101(143) (1976), pp. 360\u2013379."},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Higuchi, K., and T. Kihara, \u201cInside the Muchnik degrees, I: Discontinuity, learnability and constructivism,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 165 (2014), pp. 1058\u2013114.","DOI":"10.1016\/j.apal.2014.01.003"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] Higuchi, K., and T. Kihara, \u201cInside the Muchnik degrees, II: The degree structures induced by the arithmetical hierarchy of countably continuous functions,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 165 (2014), pp. 1201\u201341.","DOI":"10.1016\/j.apal.2014.03.001"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] 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":"6","doi-asserted-by":"crossref","unstructured":"[6] Hoyrup, M., and C. Rojas, \u201cAn application of Martin-L\u00f6f randomness to effective probability theory,\u201d pp. 260\u201369 in <i>Mathematical Theory and Computational Practice<\/i>, edited by K. Ambos-Spies, B. L\u00f6we, and W. Merkle, vol. 5635 of <i>Lecture Notes in Computer Science<\/i>, Springer, Berlin, 2009.","DOI":"10.1007\/978-3-642-03073-4_27"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Jockusch, C. G., Jr., \u201cDegrees of functions with no fixed points,\u201d pp. 191\u2013201 in <i>Logic, Methodology and Philosophy of Science, VIII (Moscow, 1987)<\/i>, 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","unstructured":"[8] Kautz, S. M., \u201cDegrees of random sets,\u201d Ph.D. dissertation, Cornell University, Ithaca, New York, 1991."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Ku\u010dera, A., \u201cMeasure, $\\Pi^{0}_{1}$-classes and complete extensions of PA,\u201d pp. 245\u201359 in <i>Recursion Theory Week (Oberwolfach, 1984)<\/i>, edited by H.-D. Ebbinghaus, G. H. M\u00fcller, and G. E. Sacks, vol. 1141 of <i>Lecture Notes in Mathematics<\/i>, Springer, Berlin, 1985.","DOI":"10.1007\/BFb0076224"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Kurtz, S. A., \u201cNotions of weak genericity,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 48 (1983), pp. 764\u201370.","DOI":"10.2307\/2273469"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Kuyper, R., \u201cNatural factors of the Muchnik lattice capturing IPC,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 164 (2013), pp. 1025\u201336.","DOI":"10.1016\/j.apal.2013.06.001"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Kuyper, R., \u201cNatural factors of the Medvedev lattice capturing IPC,\u201d <i>Archive for Mathematical Logic<\/i>, vol. 53 (2014), pp. 865\u201379.","DOI":"10.1007\/s00153-014-0393-8"},{"key":"13","unstructured":"[13] Medvedev, Y. T., \u201cDegrees of difficulty of the mass problem,\u201d <i>Doklady Akademii Nauk SSSR (NS)<\/i>, vol. 104 (1955), pp. 501\u20134."},{"key":"14","unstructured":"[14] Muchnik, A. A., \u201cOn strong and weak reducibility of algorithmic problems,\u201d <i>Sibirskii Matematicheskii Zurnal<\/i>, vol. 4 (1963), pp. 1328\u201341."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] 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":"16","unstructured":"[16] Odifreddi, P. G., <i>Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers<\/i>, vol. 125 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland, Amsterdam, 1989."},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] Shore, R. A., and T. A. Slaman, \u201cDefining the Turing jump,\u201d <i>Mathematical Research Letters<\/i>, vol. 6 (1999), pp. 711\u201322.","DOI":"10.4310\/MRL.1999.v6.n6.a10"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] Skvortsova, E. Z., \u201cExact interpretation of the intuitionistic propositional calculus by means of an initial segment of the Medvedev lattice,\u201d <i>Sibirskii Matematicheskii Zhurnal<\/i>, vol. 29 (1988), pp. 171\u201378; English translation in <i>Siberian Mathematical Journal<\/i>, vol. 29 (1988), pp. 133\u201339.","DOI":"10.1007\/BF00975025"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] Sorbi, A., \u201cSome remarks on the algebraic structure of the Medvedev lattice,\u201d <i>Journal of Symbolic Logic<\/i>, vol. 55 (1990), pp. 831\u201353.","DOI":"10.2307\/2274668"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] Sorbi, A., \u201cThe Medvedev lattice of degrees of difficulty,\u201d pp. 289\u2013312 in <i>Computability, Enumerability, Unsolvability: Directions in Recursion Theory<\/i>, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, vol. 224 of <i>London Mathematical Society Lecture Note Series<\/i>, Cambridge University Press, Cambridge, 1996.","DOI":"10.1017\/CBO9780511629167.015"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] Sorbi, A., and S. A. Terwijn, \u201cIntuitionistic logic and Muchnik degrees,\u201d <i>Algebra Universalis<\/i>, vol. 67 (2012), pp. 175\u201388.","DOI":"10.1007\/s00012-012-0176-1"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-2018-0024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:59:42Z","timestamp":1706648382000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-60\/issue-1\/Levels-of-Uniformity\/10.1215\/00294527-2018-0024.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,1,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-2018-0024","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}