Some recent research directions in the computably enumerable sets
From MaRDI portal
Publication:6599286
DOI10.1007/978-3-319-43669-2_5zbMATH Open1544.03034MaRDI QIDQ6599286
Publication date: 6 September 2024
Cites Work
- Title not available (Why is that?)
- On \(n\)-tardy sets
- Automorphisms of the lattice of recursively enumerable sets: Orbits
- Splitting theorems in recursion theory
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- The upper semi-lattice of degrees of recursive unsolvability
- \(\mathcal{D}\)-maximal sets
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
- On the orbits of computably enumerable sets
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
- Post's program and incomplete recursively enumerable sets.
- Diagonals and -maximal sets
- Automorphisms of the lattice of recursively enumerable sets
- Codable sets and orbits of computably enumerable sets
- Definable Encodings in the Computably Enumerable Sets
- Isomorphisms of splits of computably enumerable sets
- The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$
- The Complexity of Orbits of Computably Enumerable Sets
- Extension theorems, orbits, and automorphisms of the computably enumerable sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Degrees of recursively enumerable sets which have no maximal supersets
- The Δ₃⁰-automorphism method and noninvariant classes of degrees
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)
