Borel-Piecewise Continuous Reducibility for Uniformization Problems

DOI10.2168/LMCS-12(4:4)2016zbMath1445.03051arXiv1608.03269MaRDI QIDQ2974788

Takayuki Kihara

Publication date: 11 April 2017

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.03269

zbMATH Keywords

selectionpriority argumentpiecewise continuityMuchnik degreeWeihrauch degree

Mathematics Subject Classification ID

Descriptive set theory (03E15) Constructive and recursive analysis (03F60) Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78)

Related Items (2)

A syntactic approach to Borel functions: some extensions of Louveau's theorem ⋮ Computability of Subsets of Metric Spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Decomposing Borel functions and structure at finite levels of the Baire hierarchy
• More on Wadge determinacy
• First level Borel functions and isomorphisms
• Approximately differentiable functions: The r-topology
• On the role of procrastination in machine learning
• Game characterizations and lower cones in the Weihrauch degrees
• Probabilistic computability and choice
• Topological complexity with continuous operations
• 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
• A Hierarchy of Immunity and Density for Sets of Reals
• Many-one reductions and the category of multivalued functions
• On the (semi)lattices induced by continuous reducibilities
• Weihrauch degrees, omniscience principles and weak computability
• Effective Choice and Boundedness Principles in Computable Analysis
• On notions of computability-theoretic reduction between Π21 principles
• Hierarchies of function classes defined by the first-value operator
• Borel-amenable reducibilities for sets of reals
• Borel isomorphisms at the first level—I
• Survey of Measurable Selection Theorems
• Decomposing Borel sets and functions and the structure of Baire class 1 functions
• Borel–Wadge degrees
• On the algebraic structure of Weihrauch degrees
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Incomputability of Simply Connected Planar Continua
• Levels of discontinuity, limit-computability, and jump operators
• Decomposing Borel functions using the Shore–Slaman join theorem
• Baire reductions and good Borel reducibilities
• Hierarchies of Δ⁰₂‐measurable k ‐partitions
• Bad Wadge-like reducibilities on the Baire space
• Effective decomposition of σ-continuous Borel functions
• On the Structure of Finite Level and ω-Decomposable Borel Functions
• Cohesive avoidance and strong reductions
• The axiom of determinateness and reduction principles in the analytical hierarchy
• Wadge-like reducibilities on arbitrary quasi-Polish spaces

This page was built for publication: Borel-Piecewise Continuous Reducibility for Uniformization Problems