Determining Automorphisms of the Recursively Enumerable Sets

DOI10.2307/2041915zbMath0364.02023OpenAlexW4235475336MaRDI QIDQ4138719

Richard A. Shore

Publication date: 1977

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Duality, non-standard elements, and dynamic properties of r.e. sets ⋮ A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets ⋮ The Lattice of Computably Enumerable Vector Spaces ⋮ Automorphism bases for degrees of unsolvability ⋮ Recursively enumerable sets and degrees ⋮ Splitting theorems in recursion theory

Cites Work

• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Degrees of classes of RE sets
• On the Lattice of Recursively Enumerable Sets
• Automorphisms of the lattice of recursively enumerable sets
• Degrees of Unsolvability. (AM-55)
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Degrees of recursively enumerable sets which have no maximal supersets
• A Dichotomy of the Recursively Enumerable Sets