- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Lowness and Π₂⁰ nullsets
Journal of Symbolic Logic 71 (3):1044-1052 (2006)
Abstract
We prove that there exists a noncomputable c.e. real which is low for weak 2-randomness, a definition of randomness due to Kurtz, and that all reals which are low for weak 2-randomness are low for Martin-Löf randomnessAuthor's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Lowness and $\Pi _{2}^{0}$ Nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044 - 1052.
Lowness for Kurtz randomness.Noam Greenberg & Joseph S. Miller - 2009 - Journal of Symbolic Logic 74 (2):665-678.
Calibrating randomness.Rod Downey, Denis R. Hirschfeldt, André Nies & Sebastiaan A. Terwijn - 2006 - Bulletin of Symbolic Logic 12 (3):411-491.
Randomness, Lowness and Degrees.George Barmpalias, Andrew E. M. Lewis & Mariya Soskova - 2008 - Journal of Symbolic Logic 73 (2):559 - 577.
When feminism is "high" and ignorance is "low": Harriet Taylor mill on the progress of the species.Penelope Deutscher - 2006 - Hypatia 21 (3):136-150.
Wellfoundedness proofs by means of non-monotonic inductive definitions I: Π₂⁰-operators.Toshiyasu Arai - 2004 - Journal of Symbolic Logic 69 (3):830-850.
Totally ω-computably enumerable degrees and bounding critical triples.Rod Downey, Noam Greenberg & Rebecca Weber - 2007 - Journal of Mathematical Logic 7 (2):145-171.
There Are No Maximal Low D.C.E. Degrees.Liang Yu & Rod Downey - 2004 - Notre Dame Journal of Formal Logic 45 (3):147-159.
Lowness for the class of random sets.Antonín Kučera & Sebastiaan A. Terwijn - 1999 - Journal of Symbolic Logic 64 (4):1396-1402.
Computational randomness and lowness.Sebastiaan A. Terwijn & Domenico Zambella - 2001 - Journal of Symbolic Logic 66 (3):1199-1205.
Roman Murawski, recursive functions and metamathematics.Rod Downey - 2002 - Studia Logica 70 (2):297-299.
Bases of supermaximal subspaces and Steinitz systems. I.Rod Downey - 1984 - Journal of Symbolic Logic 49 (4):1146-1159.
Analytics
Added to PP
2010-08-24
Downloads
85 (#200,440)
6 months
11 (#248,819)
2010-08-24
Downloads
85 (#200,440)
6 months
11 (#248,819)
Historical graph of downloads
Author's Profile
Citations of this work
Randomness and computability: Open questions.Joseph S. Miller & André Nies - 2006 - Bulletin of Symbolic Logic 12 (3):390-410.
Randomness and lowness notions via open covers.Laurent Bienvenu & Joseph S. Miller - 2012 - Annals of Pure and Applied Logic 163 (5):506-518.
Characterizing strong randomness via Martin-Löf randomness.Liang Yu - 2012 - Annals of Pure and Applied Logic 163 (3):214-224.
Randomness and Semimeasures.Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter & Paul Shafer - 2017 - Notre Dame Journal of Formal Logic 58 (3):301-328.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c88c7cdf7-zn7n9 uwo