Help on query formulation
Low upper bounds of ideals. (English)
J. Symb. Log. 74, No. 2, 517-534 (2009).
Summary: 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 $Δ^{0}_{2} T$-degrees for which there is a low $T$-upper bound.
Classification: P20
MPG SFX Services
Valid XHTML 1.0 Transitional Valid CSS!