Automorphisms of the lattice of recursively enumerable sets: Orbits

DOI10.1016/0001-8708(92)90065-SzbMath0758.03020MaRDI QIDQ1186287

Michael Stob, Rodney G. Downey

Publication date: 28 June 1992

Published in: Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

automorphismsFriedberg splittingsrecursively enumerable degreeslattice of recursively enumerable setshalfhemimaximal sethemimaximal sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items

Nonhemimaximal degrees and the high/low hierarchy ⋮ Diagonals and -maximal sets ⋮ Highness and bounding minimal pairs ⋮ There is no fat orbit ⋮ Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility ⋮ On Splits of Computably Enumerable Sets ⋮ \(Q _{1}\)-degrees of c.e. sets ⋮ Atomless \(r\)-maximal sets ⋮ The Complexity of Orbits of Computably Enumerable Sets ⋮ Some reducibilities and splittings of recursively enumerable sets ⋮ Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets ⋮ Friedberg splittings of recursively enumerable sets ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets ⋮ Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets ⋮ On the orbits of computably enumerable sets ⋮ -MAXIMAL SETS ⋮ Definable properties of the computably enumerable sets ⋮ Some orbits for \({\mathcal E}\) ⋮ Orbits of computably enumerable sets: Low sets can avoid an upper cone ⋮ Splitting theorems in recursion theory ⋮ On orbits, of prompt and low computably enumerable sets ⋮ Definable incompleteness and Friedberg splittings ⋮ The translation theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invariance of properties under automorphisms of the lattice of recursively enumerable sets
• The intervals of the lattice of recursively enumerable sets determined by major subsets
• Some lowness properties and computational complexity sequences
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
• Splitting properties of r.e. sets and degrees
• Degree theoretical splitting properties of recursively enumerable sets
• Degrees of classes of RE sets
• Degrees of recursively enumerable sets which have no maximal supersets
• A Dichotomy of the Recursively Enumerable Sets