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

DOI10.2307/1999387zbMath0546.03024OpenAlexW4234742723MaRDI QIDQ3337460

Wolfgang Maass

Publication date: 1983

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

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)

Related Items (12)

Effectively categorical abelian groups ⋮ Computably enumerable sets that are automorphic to low sets ⋮ Isomorphism of lattices of recursively enumerable sets ⋮ Automorphisms of the lattice of recursively enumerable sets: Orbits ⋮ Friedberg splittings of recursively enumerable sets ⋮ Computably enumerable sets and related issues ⋮ Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets ⋮ Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures ⋮ Definable properties of the computably enumerable sets ⋮ The intervals of the lattice of recursively enumerable sets determined by major subsets ⋮ Splitting theorems in recursion theory ⋮ Degrees of orderings not isomorphic to recursive linear orderings

Cites Work

• Splitting properties and jump classes
• Some lowness properties and computational complexity sequences
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Recursively enumerable generic sets
• Nowhere simple sets and the lattice of recursively enumerable sets
• Recursively enumerable sets and degrees
• Computational complexity, speedable and levelable sets

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