Low upper bounds of ideals
Logic
2009-02-03 v2
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 the T-degrees below 0' for which there is a low T-upper bound.
Keywords
Cite
@article{arxiv.0708.3793,
title = {Low upper bounds of ideals},
author = {Antonin Kucera and Theodore A. Slaman},
journal= {arXiv preprint arXiv:0708.3793},
year = {2009}
}
Comments
The second version repairs the details of one argument and makes other minor corrections