61 citations · 72 across the 8 of their papers we have counts for
1 paper · 1 filter
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.