Results 1 
6 of
6
Automorphisms of the lattice of Π 0 1 classes: perfect thin classes and anc degrees
 Trans. Amer. Math. Soc
"... 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, o ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
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 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 Π0 1 classes) forms an orbit in the lattice of Π01 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.
Questions in Computable Algebra and Combinatorics
, 1999
"... this article, we will focus on two areas of computable mathematics, namely computable algebra and combinatorics. The goal of this article is to present a number of open questions in both computable algebra and computable combinatorics and to give the reader a sense of the research activity in these ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
this article, we will focus on two areas of computable mathematics, namely computable algebra and combinatorics. The goal of this article is to present a number of open questions in both computable algebra and computable combinatorics and to give the reader a sense of the research activity in these elds. Our philosophy is to try to highlight questions, whose solutions we feel will either give insight into algebra or combinatorics, or will require new technology in the computabilitytheoretical techniques needed. A good historical example of the rst phenomenom is the word problem for nitely presented groups which needed the development of a great deal of group theoretical machinery for its solution by Novikov [110] and Boone [10]. A good example of the latter phenomenon is the recent solution by Coles, Downey and Slaman [17] of the question of whether all rank one torsion free 1991 Mathematics Subject Classi cation. Primary 03D45; Secondary 03D25
AUTOMORPHISMS OF THE LATTICE OF �0 1 CLASSES; PERFECT THIN CLASSES AND ANC DEGREES
"... 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, o ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
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.
Invariance And Noninvariance In The Lattice Of Pi Classes
, 2006
"... This paper continues the study of the lattice of \Pi ..."
INVARIANCE AND NONINVARIANCE IN THE LATTICE OF � 0 1 CLASSES
"... Abstract. We prove that there are two minimal �0 1 classes that are not automorphic. ..."
Abstract
 Add to MetaCart
Abstract. We prove that there are two minimal �0 1 classes that are not automorphic.
Invariance And Noninvariance In The Lattice Of ... Classes
"... We prove that there are two minimal 1 classes that are not automorphic. ..."