paper

Turing Incomparability in Scott Sets

arXiv:math/0602439

Abstract

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.

Turing Incomparability in Scott Sets · wovepaper