Journal of Symbolic Logic

Benign cost functions and lowness properties

Noam Greenberg and André Nies

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

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.

Article information

Source
J. Symbolic Logic, Volume 76, Issue 1 (2011), 289-312.

Dates
First available in Project Euclid: 4 January 2011

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1294171001

Digital Object Identifier
doi:10.2178/jsl/1294171001

Mathematical Reviews number (MathSciNet)
MR2791349

Zentralblatt MATH identifier
1221.03036

Citation

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


Export citation