AUTOMORPHISMS OF THE LATTICE OF �0 1 CLASSES; PERFECT THIN CLASSES AND ANC DEGREES
| Citations: | 1 - 1 self |
BibTeX
@MISC{Cholak_automorphismsof,
author = {Peter Cholak and Richard Coles and Rod Downey and Eberhard Herrmann},
title = {AUTOMORPHISMS OF THE LATTICE OF �0 1 CLASSES; PERFECT THIN CLASSES AND ANC DEGREES},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. �0 1 classes are important to the logical analysis of many parts of mathematics. The �0 1 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 the 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 the collection of perfect thin classes (a notion which is definable in the lattice of �0 1 classes) form an orbit in the lattice of �0 1 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 �0 1 classes. We remark that the automorphism result is proven via a �0 3 automorphism, and demonstrate that this complexity is necessary. 1.
Citations
| 30 | Automorphisms of the lattice of recursively enumerable sets: Orbits - Downey, Stob - 1992 |
| 13 | π 0 1 classes in mathematics - Cenzer, Remmel - 1997 |
| 13 | On presentations of algebraic structures - Downey - 1997 |
| 10 | Abstract Dependence, Recursion Theory and the Lattice of Recursively Enumerable Filters Thesis - Downey - 1982 |
| 9 | 0 1 -Classes-Structure and applications, in Computability Theory and its - Cenzer, Jockusch |
| 6 | 0 1 classes in computability theory - Cenzer - 1999 |
| 6 | Effective presentability of Boolean algebras of Cantor–Bendixson rank 1 - Downey, Jockusch - 1999 |
| 3 | Array nonrecursice sets and multiple permitting arguments - Downey, Jockusch, et al. - 1990 |
| 2 | Countable thin �0 1 classes - Cenzer, Downey, et al. - 1993 |
| 1 | Maximal theories, Annals of Pure and Applied Logic, 33 - Downey - 1987 |
