Borel-piecewise continuous reducibility for uniformization problems
Abstract
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and Gδ-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to the notion of Gδ-piecewise continuity, and then we utilize this connection to obtain separation results on subclasses of Gδ-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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.