Journal of Symbolic Logic

Low upper bounds of ideals

Antonín Kučera and Theodore A. Slaman

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 there is a low T-upper bound for the class of K-trivial sets, namely those which are weak from the point of view of algorithmic randomness. This result is a special case of a more general characterization of ideals in Δ02 T-degrees for which there is a low T-upper bound.

Article information

Source
J. Symbolic Logic Volume 74, Issue 2 (2009), 517-534.

Dates
First available in Project Euclid: 2 June 2009

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

Digital Object Identifier
doi:10.2178/jsl/1243948325

Mathematical Reviews number (MathSciNet)
MR2518809

Zentralblatt MATH identifier
1168.68021

Subjects
Primary: 68Q30 (03D15)

Keywords
Turing degree K-trivial low for random

Citation

Kučera, Antonín; Slaman, Theodore A. Low upper bounds of ideals. J. Symbolic Logic 74 (2009), no. 2, 517--534. doi:10.2178/jsl/1243948325. https://projecteuclid.org/euclid.jsl/1243948325.


Export citation