Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets

DOI10.2307/2154183zbMath0769.03024OpenAlexW4252186358MaRDI QIDQ4018916

Michael Stob, Peter A. Cholak, Rodney G. Downey

Publication date: 16 January 1993

Full work available at URL: https://doi.org/10.2307/2154183

zbMATH Keywords

automorphismrecursively enumerable setpromptly simple set

Mathematics Subject Classification ID

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

Related Items

On \(n\)-tardy sets, Friedberg splittings of recursively enumerable sets, Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees, Computably enumerable sets and related issues, Permutations and Presentations, Hierarchy of Computably Enumerable Degrees II, 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

Cites Work

• Unnamed Item
• Splitting properties and jump classes
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Classical recursion theory. The theory of functions and sets of natural numbers
• Three theorems on the degrees of recursively enumerable sets
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
• Retraceable Sets
• Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
• On the orbits of hyperhypersimple sets
• Post's program and incomplete recursively enumerable sets.
• Automorphisms of the lattice of recursively enumerable sets
• On the Lattice of Recursively Enumerable Sets
• Uniformly introreducible sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability