Borel-piecewise continuous reducibility for uniformization problems
arXiv:1608.03269 · doi:10.2168/LMCS-12(4:4)2016
Abstract
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and -piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to the notion of -piecewise continuity, and then we utilize this connection to obtain separation results on subclasses of -piecewise continuous reductions for uniformization problems on set-valued functions with compact graphs. This method is also applicable for separating various non-constructive principles in the Weihrauch lattice.
References in corpus (8)
- The Bolzano-Weierstrass Theorem is the Jump of Weak König's Lemma
- On the algebraic structure of Weihrauch degrees
- Probabilistic Computability and Choice
- Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations
- Baire reductions and good Borel reducibilities
- Many-one reductions and the category of multivalued functions
- Game characterizations and lower cones in the Weihrauch degrees
- A topological view on algebraic computation models