Location of Repository

Degrees of d.c.e. reals

By Rod Downey, Guohua Wu and Xizhong Zheng

Abstract

A real is called c.e. if it is the halting probability of a prefix free Turing machine. Equivalently, a real is c.e. if it is left computable in the sense that L(α) = {q ∈ Q: q ≤ α} is a computably enumerable set. The natural field formed by the c.e. reals turns out to be the field formed by the collection of reals of the form α − β where α and β are c.e. reals. While c.e. reals can only be found in the c.e. degrees, Zheng has proven that there are ∆0 2 degrees that are not even n-c.e. for any n and yet contain d.c.e. reals. In this paper we will prove that every ω-c.e. degree contains a d.c.e. real, but there are ω+1-c.e. degrees and, hence ∆0 2 degrees, containing no d.c.e. real

Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.186.1168
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.mcs.vuw.ac.nz/%7Edo... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.