Some recent research directions in the computably enumerable sets
From MaRDI portal
Publication:6599286
Recommendations
Cites work
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
- Automorphisms of the lattice of recursively enumerable sets
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
- Automorphisms of the lattice of recursively enumerable sets: Orbits
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Codable sets and orbits of computably enumerable sets
- Definable Encodings in the Computably Enumerable Sets
- Degrees of recursively enumerable sets which have no maximal supersets
- Diagonals and -maximal sets
- Extension theorems, orbits, and automorphisms of the computably enumerable sets
- Isomorphisms of splits of computably enumerable sets
- On \(n\)-tardy sets
- On the orbits of computably enumerable sets
- Post's program and incomplete recursively enumerable sets.
- Splitting theorems in recursion theory
- The Complexity of Orbits of Computably Enumerable Sets
- The nonlow computably enumerable degrees are not invariant in \(\mathcal{E}\)
- The upper semi-lattice of degrees of recursive unsolvability
- The Δ₃⁰-automorphism method and noninvariant classes of degrees
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- \(\mathcal{D}\)-maximal sets
This page was built for publication: Some recent research directions in the computably enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599286)
