Journal of Symbolic Logic 70 (1):319 - 330 (2005)

Abstract
We show that for any real number, the class of real numbers less random than it, in the sense of rK-reducibility, forms a countable real closed subfield of the real ordered field. This generalizes the well-known fact that the computable reals form a real closed field. With the same technique we show that the class of differences of computably enumerable reals (d.c.e. reals) and the class of computably approximable reals (c.a. reals) form real closed fields. The d.c.e. result was also proved nearly simultaneously and independently by Ng (Keng Meng Ng. Master's Thesis. National University of Singapore, in preparation). Lastly, we show that the class of d.c.e. reals is properly contained in the class or reals less random than Ω (the halting probability), which in turn is properly contained in the class of c.a. reals, and that neither the first nor last class is a randomness class (as captured by rK-reducibility)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1107298522
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,192
Through your library

References found in this work BETA

The Arithmetical Hierarchy of Real Numbers.Xizhong Zheng & Klaus Weihrauch - 2001 - Mathematical Logic Quarterly 47 (1):51-66.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Schnorr Randomness.Rodney G. Downey & Evan J. Griffiths - 2004 - Journal of Symbolic Logic 69 (2):533 - 554.
WHAT IS. . . A Halting Probability?Cristian S. Calude - 2010 - Notices of the AMS 57:236-237.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
Noetherian Varieties in Definably Complete Structures.Tamara Servi - 2008 - Logic and Analysis 1 (3-4):187-204.
Subclasses of the Weakly Random Reals.Johanna N. Y. Franklin - 2010 - Notre Dame Journal of Formal Logic 51 (4):417-426.
Computational Randomness and Lowness.Sebastiaan A. Terwijn & Domenico Zambella - 2001 - Journal of Symbolic Logic 66 (3):1199-1205.
Relative Randomness and Cardinality.George Barmpalias - 2010 - Notre Dame Journal of Formal Logic 51 (2):195-205.
Every 2-Random Real is Kolmogorov Random.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (3):907-913.
Reducts of Some Structures Over the Reals.Ya′Acov Peterzil - 1993 - Journal of Symbolic Logic 58 (3):955-966.
Mapping a Set of Reals Onto the Reals.Arnold W. Miller - 1983 - Journal of Symbolic Logic 48 (3):575-584.
Groundwork for Weak Analysis.António M. Fernandes & Fernando Ferreira - 2002 - Journal of Symbolic Logic 67 (2):557-578.

Analytics

Added to PP index
2010-08-24

Total views
28 ( #408,400 of 2,507,320 )

Recent downloads (6 months)
1 ( #417,155 of 2,507,320 )

How can I increase my downloads?

Downloads

My notes