SearcharxivSearch

arXiv subjects

Peter Gerdes

Publications and source records attributed to Peter Gerdes.

3 recordsLinked to original sources

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

In the study of the arithmetic degrees (the degree structure induced by relative arithmetic definability, ($\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 $\Pi^0_2$ singleton of minimal arithmetic degree. Not only is this a result of considerable interest in it's own right, constructions of $\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.

math.LO

$\mathcal{D}$-maximal sets

Soare proved that the maximal sets form an orbit in $\mathcal{E}$. We consider here $\mathcal{D}$-maximal sets, generalizations of maximal sets introduced by Herrmann and Kummer. Some orbits of $\mathcal{D}$-maximal sets are well understood, e.g., hemimaximal sets, but many are not. The goal of this paper is to define new invariants on computably enumerable sets and to use them to give a complete nontrivial classification of the $\mathcal{D}$-maximal sets. Although these invariants help us to better understand the $\mathcal{D}$-maximal sets, we use them to show that several classes of $\mathcal{D}$-maximal sets break into infinitely many orbits.

math.LO