Article contents
Low upper bounds of ideals
Published online by Cambridge University Press: 12 March 2014
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.
Keywords
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2009
References
REFERENCES
- 7
- Cited by