pith. sign in

arxiv: math/0602439 · v2 · submitted 2006-02-20 · 🧮 math.LO

Turing Incomparability in Scott Sets

Antonin Kucera , Theodore A. Slaman This is my paper
classification 🧮 math.LO
keywords everyscottturingincomparabilityincomparablenonrecursivesetsthere
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.