1 citations · 1 across the 2 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2007★ 1 cited
Low upper bounds of ideals
Antonin Kucera, Theodore A. Slaman
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 ca…
math.LO2006
Turing Incomparability in Scott Sets
Antonin Kucera, Theodore A. Slaman
For every Scott set F and every nonrecursive set X in F, there is a Y in F such that X and Y are Turing incomparable.