How many Turing degrees are there?

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
12 pages

Keywords

Logic, 03D30, 03E15 (Primary) 04A15, 54H05 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/58594

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0001173
 http://arxiv.org/abs/math/0001173

Collections

arXiv