Turing Degrees of Hyperjumps
Hayden R. Jananthan, Stephen G. Simpson

TL;DR
This paper extends the Posner-Robinson Theorem to the hyperarithmetical setting, showing that nonhyperarithmetical degrees are hyperjumps relative to some oracle, thus broadening the understanding of Turing degrees and hyperjumps.
Contribution
It proves a hyperarithmetical analog of the Posner-Robinson Theorem, linking nonhyperarithmetical degrees to hyperjumps relative to some oracle.
Findings
Established a hyperarithmetical analog of the Posner-Robinson Theorem.
Showed that nonhyperarithmetical degrees are hyperjumps relative to some oracle.
Extended classical results to the hyperarithmetical hierarchy.
Abstract
The Posner-Robinson Theorem states that for any reals and such that and , there exists such that . Consequently, any nonzero Turing degree is a Turing jump relative to some . Here we prove the hyperarithmetical analog, based on an unpublished proof of Slaman, namely that for any reals and such that and , there exists such that . As an analogous consequence, any nonhyperarithmetical Turing degree is a hyperjump relative to some .
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 · Mathematical and Theoretical Analysis
