Determining Automorphisms of the Recursively Enumerable Sets

DOI10.2307/2041915zbMATH Open0364.02023OpenAlexW4235475336MaRDI QIDQ4138719FDOQ4138719

Authors: 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)

Cites Work

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

Cited In (6)

• Splitting theorems in recursion theory
• The Lattice of Computably Enumerable Vector Spaces
• Recursively enumerable sets and degrees
• 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
• Automorphism bases for degrees of unsolvability

This page was built for publication: Determining Automorphisms of the Recursively Enumerable Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138719)