Orbits of computably enumerable sets: Low sets can avoid an upper cone

DOI10.1016/S0168-0072(01)00119-1zbMath1023.03035MaRDI QIDQ1849863

Russell G. Miller

Publication date: 2 December 2002

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

orbitcomputably enumerable degreeslattice automorphismsupper conelow computably enumerable set

Mathematics Subject Classification ID

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

Related Items

Computably enumerable sets that are automorphic to low sets

Cites Work

• Friedberg splittings of recursively enumerable sets
• The intervals of the lattice of recursively enumerable sets determined by major subsets
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Definable properties of the computably enumerable sets
• Some orbits for \({\mathcal E}\)
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• On orbits, of prompt and low computably enumerable sets
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Jumps of Hemimaximal Sets
• Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
• Post's program and incomplete recursively enumerable sets.
• Automorphisms of the lattice of recursively enumerable sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• The Δ₃⁰-automorphism method and noninvariant classes of degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item