Determining Automorphisms of the Recursively Enumerable Sets

DOI10.2307/2041915MaRDI QIDQ4138719zbMATHOpenAlexFDO

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

• A Dichotomy of the Recursively Enumerable Sets
• Automorphisms of the lattice of recursively enumerable sets
• 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)
• Degrees of classes of RE sets
• Degrees of recursively enumerable sets which have no maximal supersets
• On the Lattice of Recursively Enumerable Sets

Cited in

(6)

• A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
• The Lattice of Computably Enumerable Vector Spaces
• Recursively enumerable sets and degrees
• Splitting theorems in recursion theory
• Duality, non-standard elements, and dynamic properties of r.e. 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)