Transactions of the American Mathematical Society · 2001 · 26 citations · 17 references
Natural SciencesComputer ScienceMathematicsAlgebraNumber TheorySet TheoryAbstract AlgebraAxiomatic Set TheoryLogical Characterizations Of Complexity ClassesTuring Degrees
$\Pi _1^0$ classes are important to the logical analysis of many parts of mathematics. The $\Pi _1^0$ classes form a lattice. As with the lattice of computably enumerable sets, it is natural to explore the relationship between this lattice and the Turing degrees. We focus on an analog of maximality, or more precisely, hyperhypersimplicity, namely the notion of a thin class. We prove a number of results relating automorphisms, invariance, and thin classes. Our main results are an analog of Martinâs work on hyperhypersimple sets and high degrees, using thin classes and anc degrees, and an analog of Soareâs work demonstrating that maximal sets form an orbit. In particular, we show that the collection of perfect thin classes (a notion which is definable in the lattice of $\Pi _1^0$ classes) forms an orbit in the lattice of $\Pi _1^0$ classes; and a degree is anc iff it contains a perfect thin class. Hence the class of anc degrees is an invariant class for the lattice of $\Pi _1^0$ classes. We remark that the automorphism result is proven via a $\Delta _3^0$ automorphism, and demonstrate that this complexity is necessary.
17
Theory of Recursive Functions and Effective Computability
D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text
Recursively enumerable sets and degrees
Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text