Arithmetical Measure

Mathematical Logic Quarterly 44 (2):277-286 (1998)
  Copy   BIBTEX

Abstract

We develop arithmetical measure theory along the lines of Lutz [10]. This yields the same notion of measure 0 set as considered before by Martin-Löf, Schnorr, and others. We prove that the class of sets constructible by r.e.-constructors, a direct analogue of the classes Lutz devised his resource bounded measures for in [10], is not equal to RE, the class of r.e. sets, and we locate this class exactly in terms of the common recursion-theoretic reducibilities below K. We note that the class of sets that bounded truth-table reduce to K has r.e.-measure 0, and show that this cannot be improved to truth-table. For Δ2-measure the borderline between measure zero and measure nonzero lies between weak truth-table reducibility and Turing reducibility to K. It follows that there exists a Martin-Löf random set that is tt-reducible to K, and that no such set is btt-reducible to K. In fact, by a result of Kautz, a much more general result holds

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Van Lambalgen's Theorem and High Degrees.Johanna N. Y. Franklin & Frank Stephan - 2011 - Notre Dame Journal of Formal Logic 52 (2):173-185.
Lowness and $\Pi _{2}^{0}$ Nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044 - 1052.
Probabilistic algorithmic randomness.Sam Buss & Mia Minnes - 2013 - Journal of Symbolic Logic 78 (2):579-601.
Relative Randomness and Cardinality.George Barmpalias - 2010 - Notre Dame Journal of Formal Logic 51 (2):195-205.
Algorithmic randomness and measures of complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Characterizing strong randomness via Martin-Löf randomness.Liang Yu - 2012 - Annals of Pure and Applied Logic 163 (3):214-224.
Schnorr Randomness.Rodney G. Downey & Evan J. Griffiths - 2004 - Journal of Symbolic Logic 69 (2):533 - 554.
Truth-table Schnorr randomness and truth-table reducible randomness.Kenshi Miyabe - 2011 - Mathematical Logic Quarterly 57 (3):323-338.
Measure, randomness and sublocales.Alex Simpson - 2012 - Annals of Pure and Applied Logic 163 (11):1642-1659.
Chance versus Randomness.Antony Eagle - 2010 - Stanford Encyclopedia of Philosophy.

Analytics

Added to PP
2013-12-01

Downloads
24 (#653,725)

6 months
6 (#509,130)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Leen Torenvliet
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..
Classical Recursion Theory.Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.
Logical depth and physical complexity.C. H. Bennett - 1988 - In R. Herken (ed.), The universal Turing machine, a half century survey. Oxford University Press. pp. 227-257.

Add more references