Translator Disclaimer
June 2009 Low upper bounds of ideals
Antonín Kučera, Theodore A. Slaman
J. Symbolic Logic 74(2): 517-534 (June 2009). DOI: 10.2178/jsl/1243948325

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.

Citation

Download Citation

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

Information

Published: June 2009
First available in Project Euclid: 2 June 2009

zbMATH: 1168.68021
MathSciNet: MR2518809
Digital Object Identifier: 10.2178/jsl/1243948325

Subjects:
Primary: 68Q30 (03D15)

Rights: Copyright © 2009 Association for Symbolic Logic

JOURNAL ARTICLE
18 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.74 • No. 2 • June 2009
Back to Top