Pseudojump inversion in special r. b. $\Pi^0_1$ classes
Hayden R. Jananthan, Stephen G. Simpson

TL;DR
This paper explores the possibility of refining classical theorems in computability theory by finding solutions within special a0^0_1 classes, revealing limitations and possibilities of such refinements.
Contribution
It demonstrates that certain theorems can be refined within some special a0^0_1 classes but not in others, highlighting nuanced limitations.
Findings
Refinements are possible in some a0^0_1 classes.
Refinements are impossible in certain other a0^0_1 classes.
The results delineate the boundaries of such refinements.
Abstract
The Jump Inversion Theorem says that for every real there is a real such that . A known refinement of this theorem says that we can choose to be a member of any special subclass of . We now consider the possibility of analogous refinements of two other well-known theorems: the Join Theorem -- for all reals and such that and , there is a real such that -- and the Pseudojump Inversion Theorem -- for all reals and every , there is a real such that . We show that in these theorems, can be found in some special subclasses of but not in others.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Geometric and Algebraic Topology
