Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
From MaRDI portal
Publication:3337460
Recommendations
Cites work
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Computational complexity, speedable and levelable sets
- Nowhere simple sets and the lattice of recursively enumerable sets
- Recursively enumerable generic sets
- Recursively enumerable sets and degrees
- Some lowness properties and computational complexity sequences
- Splitting properties and jump classes
Cited in
(17)- Some recent research directions in the computably enumerable sets
- Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
- Effectively categorical abelian groups
- Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
- scientific article; zbMATH DE number 3878379 (Why is no real title available?)
- Computably enumerable sets that are automorphic to low sets
- The ordertype of β-R.E. sets
- scientific article; zbMATH DE number 4114607 (Why is no real title available?)
- The intervals of the lattice of recursively enumerable sets determined by major subsets
- Friedberg splittings of recursively enumerable sets
- Computably enumerable sets and related issues
- Definable properties of the computably enumerable sets
- Isomorphism of lattices of recursively enumerable sets
- Splitting theorems in recursion theory
- A class of recursively enumerable sets
- Degrees of orderings not isomorphic to recursive linear orderings
- Automorphisms of the lattice of recursively enumerable sets: Orbits
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)
