Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets

DOI10.2307/1999387zbMATH Open0546.03024OpenAlexW4234742723MaRDI QIDQ3337460FDOQ3337460

Wolfgang Maass

Publication date: 1983

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

Recommendations

• Isomorphism of lattices of recursively enumerable sets
• scientific article; zbMATH DE number 3924766
• Nonisomorphism of lattices of recursively enumerable sets
• Definable structures in the lattice of recursively enumerable sets
• Subsets of hypersimple sets

zbMATH Keywords

outer splittinglattices of supersets of r.e. sets

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
• Recursively enumerable sets and degrees
• Nowhere simple sets and the lattice of recursively enumerable sets
• Splitting properties and jump classes
• Recursively enumerable generic sets
• Computational complexity, speedable and levelable sets
• Some lowness properties and computational complexity sequences

Cited In (17)

• Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
• Friedberg splittings of recursively enumerable sets
• A class of recursively enumerable sets
• The intervals of the lattice of recursively enumerable sets determined by major subsets
• Splitting theorems in recursion theory
• Some recent research directions in the computably enumerable sets
• The ordertype of β-R.E. sets
• Definable properties of the computably enumerable sets
• Isomorphism of lattices of recursively enumerable sets
• Computably enumerable sets and related issues
• Degrees of orderings not isomorphic to recursive linear orderings
• Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Title not available (Why is that?)
• Effectively categorical abelian groups
• Title not available (Why is that?)
• Computably enumerable sets that are automorphic to low sets

This page was built for publication: Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets

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