English

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

Logic 2024-04-01 v2

Abstract

In the study of the arithmetic degrees (the degree structure induced by relative arithmetic definability, (a\leq_{a}) the ω\omega-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 ω\omega-REA sets in that structure than about the Turing degrees. Indeed, even basic questions such as the existence of a ω\omega-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 ω\omega-REA set is arithmetically minimal. Finally, it constructs a Π20\Pi^0_2 singleton of minimal arithmetic degree. Not only is this a result of considerable interest in it's own right, constructions of Π20\Pi^0_2 singletons often pave the way for constructions of ω\omega-REA sets with similar properties. Along the way, a number of interesting results relating arithmetic reducibility and rates of growth are established.

Cite

@article{arxiv.2308.12102,
  title  = {A $\Pi^0_2$ Singleton of Minimal Arithmetic Degree},
  author = {Peter Gerdes},
  journal= {arXiv preprint arXiv:2308.12102},
  year   = {2024}
}
R2 v1 2026-06-28T12:02:27.833Z