How many Turing degrees are there?

Details How many Turing degrees are there? How many Turing degrees are there?

2000-01-28

arxiv.org/abs/math/0001173v1

Mathematics

Logic

12 pages

Scientific paper

A Borel equivalence relation on a Polish space is said to be countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in recursion theory are: recursive isomorphism, Turing equivalence, arithmetic equivalence, etc. There is a canonical hierarchy of complexity of countable Borel equivalence relations imposed by the notion of Borel reducibility. We will survey results and conjectures concerning the problem of identifying the place in this hierarchy of these equivalence relations from recursion theory and also discuss some of their implications.

Affiliated with

Also associated with

No associations

Rating

How many Turing degrees are there? 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 How many Turing degrees are there?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How many Turing degrees are there? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-53857