Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 76, Issue 1 (2011), 289-312.
Benign cost functions and lowness properties
We show that the class of strongly jump-traceable c.e. sets can be characterised as those which have sufficiently slow enumerations so they obey a class of well-behaved cost functions, called benign. This characterisation implies the containment of the class of strongly jump-traceable c.e. Turing degrees in a number of lowness classes, in particular the classes of the degrees which lie below incomplete random degrees, indeed all LR-hard random degrees, and all ω-c.e. random degrees. The last result implies recent results of Diamondstone's and Ng's regarding cupping with superlow c.e. degrees and thus gives a use of algorithmic randomness in the study of the c.e. Turing degrees.
J. Symbolic Logic, Volume 76, Issue 1 (2011), 289-312.
First available in Project Euclid: 4 January 2011
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Greenberg, Noam; Nies, André. Benign cost functions and lowness properties. J. Symbolic Logic 76 (2011), no. 1, 289--312. doi:10.2178/jsl/1294171001. https://projecteuclid.org/euclid.jsl/1294171001