Turing Incomparability in Scott Sets

Details Turing Incomparability in Scott Sets Turing Incomparability in Scott Sets

2006-02-20

arxiv.org/abs/math/0602439v2

Mathematics

Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Turing Incomparability in Scott Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Turing Incomparability in Scott Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Turing Incomparability in Scott Sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-520833