Decomposing Borel functions using the Shore–Slaman join theorem
From MaRDI portal
Publication:4983474
DOI10.4064/fm230-1-1zbMath1368.03045arXiv1304.0698OpenAlexW2963345984MaRDI QIDQ4983474
Publication date: 26 March 2015
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.0698
Descriptive set theory (03E15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05) Other Turing degree structures (03D28)
Related Items
Three topological reducibilities for discontinuous functions, Uniformity results on the Baire property, Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism, Wadge-like degrees of Borel bqo-valued functions, A syntactic approach to Borel functions: some extensions of Louveau's theorem, A comparison of concepts from computable analysis and effective descriptive set theory, Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces, Borel-Piecewise Continuous Reducibility for Uniformization Problems, Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions, The Dyck and the Preiss separation uniformly, Turing degrees in Polish spaces and decomposability of Borel functions, DECOMPOSING FUNCTIONS OF BAIRE CLASS ON POLISH SPACES, Point Degree Spectra of Represented Spaces, Computability of Subsets of Metric Spaces, Weihrauch Complexity in Computable Analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Closed choice and a uniform low basis theorem
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Decomposing Borel functions and structure at finite levels of the Baire hierarchy
- First level Borel functions and isomorphisms
- Definability in the enumeration degrees
- Defining the Turing jump
- Quasi-Polish spaces
- \(\sigma \)-continuity and related forcings
- 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
- L1-Computability, Layerwise Computability and Solovay Reducibility
- Effective Choice and Boundedness Principles in Computable Analysis
- Effective Borel measurability and reducibility of functions
- An Application of Martin-Löf Randomness to Effective Probability Theory
- Degrees joining to 0′
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- The space of class $\alpha$ Baire functions
- Decomposing Borel sets and functions and the structure of Baire class 1 functions
- Levels of discontinuity, limit-computability, and jump operators
- On the Structure of Finite Level and ω-Decomposable Borel Functions
- Limits to joining with generics and randoms
- Wadge-like reducibilities on arbitrary quasi-Polish spaces
