{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:21Z","timestamp":1760202621614},"reference-count":22,"publisher":"Duke University Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2011,4,1]]},"DOI":"10.1215\/00294527-1306181","type":"journal-article","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T13:02:18Z","timestamp":1303995738000},"source":"Crossref","is-referenced-by-count":7,"title":["Van Lambalgen's Theorem and High Degrees"],"prefix":"10.1215","volume":"52","author":[{"given":"Johanna N.Y.","family":"Franklin","sequence":"first","affiliation":[]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Cholak, P., N. Greenberg, and J. S. Miller, \"Uniform almost everywhere domination\", <i>The Journal of Symbolic Logic<\/i>, vol. 71 (2006), pp. 1057\u201372.","DOI":"10.2178\/jsl\/1154698592"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Cooper, S. B., \"Minimal degrees and the jump operator\", <i>The Journal of Symbolic Logic<\/i>, vol. 38 (1973), pp. 249\u201371.","DOI":"10.2307\/2272061"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] 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":"5","doi-asserted-by":"publisher","unstructured":"[5] Franklin, J. N. Y., and F. Stephan, \"Schnorr trivial sets and truth-table reducibility\", <i>The Journal of Symbolic Logic<\/i>, vol. 75 (2010), pp. 501\u201321.","DOI":"10.2178\/jsl\/1268917492"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Ku\u010dera, A., \"Measure, $\\Pi^0_1$\"-classes and complete extensions of ${\\rm PA}$, pp. 245\u201359 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":"10","doi-asserted-by":"publisher","unstructured":"[10] van Lambalgen, M., \"The axiomatization of randomness\", <i>The Journal of Symbolic Logic<\/i>, vol. 55 (1990), pp. 1143\u201367.","DOI":"10.2307\/2274480"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] Martin-L\u00f6f, P., \"The definition of random sequences\", <i>Information and Computation<\/i>, vol. 9 (1966), pp. 602\u201319.","DOI":"10.1016\/S0019-9958(66)80018-9"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Merkle, W., and N. Mihailovi\u0107, \"On the construction of effectively random sets\", <i>The Journal of Symbolic Logic<\/i>, vol. 69 (2004), pp. 862\u201378.","DOI":"10.2178\/jsl\/1096901772"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Merkle, W., J. S. Miller, A. Nies, J. Reimann, and F. Stephan, \"Kolmogorov-Loveland randomness and stochasticity\", <i>Annals of Pure and Applied Logic<\/i>, vol. 138 (2006), pp. 183\u2013210.","DOI":"10.1016\/j.apal.2005.06.011"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] Nies, A., <i>Computability and Randomness<\/i>, vol. 51 of <i>Oxford Logic Guides<\/i>, The Clarendon Press, Oxford, 2009.","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] 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\u201335.","DOI":"10.2178\/jsl\/1120224726"},{"key":"17","unstructured":"[17] Odifreddi, P. G., <i>Classical Recursion Theory. Vol. II<\/i>, vol. 143 of <i>Studies in Logic and the Foundations of Mathematics<\/i>, North-Holland Publishing Co., Amsterdam, 1999."},{"key":"18","unstructured":"[18] Odifreddi, P., <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 Publishing Co., Amsterdam, 1989."},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] 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":"22","doi-asserted-by":"publisher","unstructured":"[22] Yu, L., \"When van Lambalgen's theorem fails\", <i>Proceedings of the American Mathematical Society<\/i>, vol. 135 (2007), pp. 861\u201364.","DOI":"10.1090\/S0002-9939-06-08541-8"},{"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":"3","unstructured":"[3] Day, A. R., and A. Fitzgerald., \"Indifferent sets for 1-generics\". In progress."},{"key":"6","unstructured":"[6] Franklin, J. N. Y., N. Greenberg, F. Stephan, and G. Wu, \"Anti-complex sets and reducibilities with tiny use\", Submitted."},{"key":"7","unstructured":"[7] Franklin, J. N. Y., F. Stephan, and L. Yu, \"Relativizations of randomness and genericity notions\", Forthcoming in the <i>Bulletin of the London Mathematical Society<\/i>."},{"key":"9","unstructured":"[9] Kurtz, S. A., <i>Randomness and Genericity in the Degrees of Unsolvability<\/i>, Ph.D. thesis, University of Illinois, Urbana-Champaign, 1981."},{"key":"14","unstructured":"[14] Miyabe, K., \"Truth-table Schnorr randomness and truth-table reducibly randomness\", <i>Mathematical Logic Quarterly<\/i>. Forthcoming."},{"key":"21","unstructured":"[21] Wang, Y., <i>Randomness and Complexity. (Inaugural Dissertation)<\/i>, Naturwissenschaftlich-Mathematische Gesamtfakult\u00e4t, Ruprecht-Karls-Universit\u00e4t, Heidelberg, 1996."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-1306181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:39Z","timestamp":1706648259000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-52\/issue-2\/Van-Lambalgens-Theorem-and-High-Degrees\/10.1215\/00294527-1306181.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,1]]},"references-count":22,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2011,4,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-1306181","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2011,4,1]]}}}