Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T21:48:52.183Z Has data issue: false hasContentIssue false

Low upper bounds of ideals

Published online by Cambridge University Press:  12 March 2014

Antonín Kučera
Affiliation:
Charles University, Faculty of Mathematics and Physics, Department of Theoretical Computer Science, and Mathematical Logic, Malostranské Nám. 25, 118 00 Praha 1., Czech Republic, E-mail: kucera@ksi.mff.cuni.cz
Theodore A. Slaman
Affiliation:
University of California, Berkeley, Department of Mathematics, Berkeley, Ca 94720-3840, USA, E-mail: slaman@math.berkeley.edu

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 T-degrees for which there is a low T-upper bound.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable