Results 1  10
of
25
Automorphisms of the lattice of recursively enumerable sets: Orbits, Adv
"... JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JS ..."
Abstract

Cited by 37 (17 self)
 Add to MetaCart
JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org. American Mathematical Society is collaborating with JSTOR to digitize, preserve and extend access to
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 17 (6 self)
 Add to MetaCart
(Show Context)
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.
Countable thin Π0 1 classes
 Annals of Pure and Applied Logic
, 1993
"... Abstract. AΠ0 1 class P ⊂ {0,1}ωis thin if every Π0 1 subclass Q of P is the intersection of P with some clopen set. Countable thin Π0 1 classes are constructed having arbitrary recursive CantorBendixson rank. A thin Π0 1 class P is constructed with a unique nonisolated point A of degree 0 ′. It is ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Abstract. AΠ0 1 class P ⊂ {0,1}ωis thin if every Π0 1 subclass Q of P is the intersection of P with some clopen set. Countable thin Π0 1 classes are constructed having arbitrary recursive CantorBendixson rank. A thin Π0 1 class P is constructed with a unique nonisolated point A of degree 0 ′. It is shown that, for all ordinals α>1, no set of degree ≥ 0 ′ ′ can be a member of any thin Π0 1 class. An r.e. degree d is constructed such that no set of degree d can be a member of any thin Π0 1 class. It is also shown that between any two distinct comparable r.e. degrees, there is a degree (not necessarily r.e.) that contains a set which is of rank one in some thin Π0 1 class. It is shown that no maximal set can have rank one in any Π01 class, while there exist maximal sets of rank 2. The connection between Π0 1 classes, propositional theories and recursive Boolean algebras is explored, producing several corollaries to the results on Π0 1 classes. For example, call a recursive Boolean algebra thin if it has no proper nonprincipal recursive ideals. Then no thin recursive Boolean algebra can have a maximal ideal of degree 0 ′ ′. Introduction.
Extension theorems, orbits, and automorphisms of the computably enumerable sets
 TRANS. AMER. MATH. SOC.
, 2008
"... We prove an algebraic extension theorem for the computably enumerable sets, E. Using this extension theorem and other work we then show if A and � A are automorphic via Ψ, then they are automorphic via Λ where Λ ↾ L ∗ (A) =ΨandΛ↾E ∗ (A) is∆0 3. We give an algebraic description of when an arbitrary ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
We prove an algebraic extension theorem for the computably enumerable sets, E. Using this extension theorem and other work we then show if A and � A are automorphic via Ψ, then they are automorphic via Λ where Λ ↾ L ∗ (A) =ΨandΛ↾E ∗ (A) is∆0 3. We give an algebraic description of when an arbitrary set �A is in the orbit of a computably enumerable set A. We construct the first example of a definable orbit which is not a ∆0 3 orbit. We conclude with some results which restrict the ways one can increase the complexity of orbits. For example, we show that if A is simple and �A is in the same orbit as A, then they are in the same ∆0 6orbit and, furthermore, we provide a classification of when two simple sets are in the same orbit.
On the Orbits of Computable Enumerable Sets
, 2007
"... The goal of this paper is to show there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is Σ1 1complete. This result and proof have a number of nice corollaries: the Scott rank of E is ωCK 1 + 1; not all orbits are elementarily definable; th ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
The goal of this paper is to show there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is Σ1 1complete. This result and proof have a number of nice corollaries: the Scott rank of E is ωCK 1 + 1; not all orbits are elementarily definable; there is no arithmetic description of all orbits of E; for all finite α ≥ 9, there is a properly ∆0 α orbit (from the proof).
The complexity of orbits of computably enumerable sets
 BULLETIN OF SYMBOLIC LOGIC
, 2008
"... The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is Σ1 1complete. This result and proof have a number of nice corollaries: the Scott rank of E is ωCK 1 + 1; not all orbits are elementarily definable; ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is Σ1 1complete. This result and proof have a number of nice corollaries: the Scott rank of E is ωCK 1 + 1; not all orbits are elementarily definable; there is no arithmetic description of all orbits of E; for all finite α ≥ 9, there is a properly ∆0 α orbit (from the proof).
Atomless rmaximal sets
 Israel J. Math
"... Abstract. We focus on L(A), the filter of supersets of A in the structure of the computably enumerable sets under the inclusion relation, where A is an atomless rmaximal set. We answer a long standing question by showing that there are infinitely many pairwise nonisomorphic filters of this type. 1 ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We focus on L(A), the filter of supersets of A in the structure of the computably enumerable sets under the inclusion relation, where A is an atomless rmaximal set. We answer a long standing question by showing that there are infinitely many pairwise nonisomorphic filters of this type. 1.