Decomposing Borel functions using the Shore-Slaman join theorem
From MaRDI portal
Publication:4983474
Abstract: Jayne and Rogers proved that every function from an analytic space into a separable metric space is decomposable into countably many continuous functions with closed domains if and only if the preimage of each set under it is again . Many researchers conjectured that the Jayne-Rogers theorem can be generalized to all finite levels of Borel functions. In this paper, by using the Shore-Slaman join theorem on the Turing degrees, we show the following variant of the Jayne-Rogers theorem at finite and transfinite levels of the hierarchy of Borel functions: For all countable ordinals and with , every function between Polish spaces having small transfinite inductive dimension is decomposable into countably many Baire class functions with domains such that if and only if the preimage of each set under that function is , and the transformation of a set into the preimage is continuous.
Recommendations
Cites work
- \(\sigma \)-continuity and related forcings
- L^1-computability, layerwise computability and Solovay reducibility
- An application of Martin-Löf randomness to effective probability theory
- Closed choice and a uniform low basis theorem
- Decomposing Borel functions and structure at finite levels of the Baire hierarchy
- Decomposing Borel sets and functions and the structure of Baire class 1 functions
- Definability in the enumeration degrees
- Defining the Turing jump
- Degrees joining to 0′
- Effective Borel measurability and reducibility of functions
- Effective Choice and Boundedness Principles in Computable Analysis
- First level Borel functions and isomorphisms
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Levels of discontinuity, limit-computability, and jump operators
- Limits to joining with generics and randoms
- On the Structure of Finite Level and ω-Decomposable Borel Functions
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- Quasi-Polish spaces
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- The SLO principle and the Wadge hierarchy
- The space of class \alpha Baire functions
- Wadge-like reducibilities on arbitrary quasi-Polish spaces
Cited in
(16)- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Borel-piecewise continuous reducibility for uniformization problems
- A comparison of concepts from computable analysis and effective descriptive set theory
- Uniformity results on the Baire property
- Turing degrees in Polish spaces and decomposability of Borel functions
- Computability of Subsets of Metric Spaces
- Weihrauch Complexity in Computable Analysis
- Three topological reducibilities for discontinuous functions
- Wadge-like degrees of Borel bqo-valued functions
- Disjoint Borel functions
- DECOMPOSING FUNCTIONS OF BAIRE CLASS ON POLISH SPACES
- Point Degree Spectra of Represented Spaces
- A syntactic approach to Borel functions: some extensions of Louveau's theorem
- The Dyck and the Preiss separation uniformly
This page was built for publication: Decomposing Borel functions using the Shore-Slaman join theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4983474)