Turing degrees in Polish spaces and decomposability of Borel functions

Journal of Mathematical Logic 21 (1):2050021 (2020)
  Copy   BIBTEX

Abstract

We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results from effective descriptive set theory and recursion theory. In fact it is essential to extend several prominent results in recursion theory (e.g. the Shore-Slaman Join Theorem) to the setting of Polish spaces. As a by-product we give both positive and negative results on the Martin Conjecture on the degree preserving Borel functions between Polish spaces. Additionally we prove results about the transfinite version as well as the computable version of the Decomposability Conjecture

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,462

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Quasi-Polish spaces.Matthew de Brecht - 2013 - Annals of Pure and Applied Logic 164 (3):356-381.
New directions in descriptive set theory.Alexander S. Kechris - 1999 - Bulletin of Symbolic Logic 5 (2):161-174.
A q-wadge hierarchy in quasi-polish spaces.Victor Selivanov - 2020 - Journal of Symbolic Logic:1-26.
Effective Borel measurability and reducibility of functions.Vasco Brattka - 2005 - Mathematical Logic Quarterly 51 (1):19-44.
Results on Martin’s Conjecture.Patrick Lutz - 2021 - Bulletin of Symbolic Logic 27 (2):219-220.

Analytics

Added to PP
2020-04-30

Downloads
29 (#647,770)

6 months
10 (#288,628)

Historical graph of downloads
How can I increase my downloads?