A $\Pi^0_2$ Singleton of Minimal Arithmetic Degree
Peter Gerdes

TL;DR
This paper advances understanding of arithmetic degrees by constructing a $ ext{Pi}^0_2$ singleton with minimal arithmetic degree, highlighting new methods and clarifying the role of $ ext{omega}$-REA sets.
Contribution
It constructs a $ ext{Pi}^0_2$ singleton of minimal arithmetic degree, providing new insights into the structure of arithmetic degrees and the role of $ ext{omega}$-REA sets.
Findings
Constructed a $ ext{Pi}^0_2$ singleton of minimal arithmetic degree.
Showed that approaches inspired by r.e. sets do not prove the non-existence of minimal $ ext{omega}$-REA sets.
Established results relating arithmetic reducibility and growth rates.
Abstract
In the study of the arithmetic degrees (the degree structure induced by relative arithmetic definability, () the -REA sets play a role analogous to the role the r.e. degrees play in the study of the Turing degrees. However, much less is known about the arithmetic degrees and the role of the -REA sets in that structure than about the Turing degrees. Indeed, even basic questions such as the existence of a -REA set of minimal arithmetic degree are open. This paper makes progress on this question by demonstrating that some promising approaches inspired by the analogy with the r.e sets fail to show that no -REA set is arithmetically minimal. Finally, it constructs a singleton of minimal arithmetic degree. Not only is this a result of considerable interest in it's own right, constructions of singletons often pave the way for…
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
TopicsMathematical and Theoretical Analysis · Computability, Logic, AI Algorithms · Numerical Methods and Algorithms
