Turing degrees in Polish spaces and decomposability of Borel functions
Authors:
- 4 June 2020
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Journal of Mathematical Logic
- Vol. 21 (01)
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.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Decomposing Borel functions using the Shore–Slaman join theoremFundamenta Mathematicae, 2015
- Effective decomposition of σ-continuous Borel functionsFundamenta Mathematicae, 2014
- Some Observations on ‘A New Proof of a Theorem of Jayne and Rogers’Real Analysis Exchange, 2013
- Effective Borel measurability and reducibility of functionsMathematical Logic Quarterly, 2004
- Degrees of unsolvability of continuous functionsThe Journal of Symbolic Logic, 2004
- DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREESJournal of Mathematical Logic, 2003
- Borel isomorphisms at the first level—IMathematika, 1979
- Cabal Seminar 76–771978
- The space of class $\alpha$ Baire functionsBulletin of the American Mathematical Society, 1974
- The axiom of determinateness and reduction principles in the analytical hierarchyBulletin of the American Mathematical Society, 1968