Diagonals and -maximal sets
From MaRDI portal
Publication:4292592
DOI10.2307/2275249zbMath0799.03046OpenAlexW2162195505MaRDI QIDQ4292592
No author found.
Publication date: 24 November 1994
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275249
Related Items (5)
Duality, non-standard elements, and dynamic properties of r.e. sets ⋮ On Splits of Computably Enumerable Sets ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets ⋮ Some orbits for \({\mathcal E}\) ⋮ Splitting theorems in recursion theory
Cites Work
- Unnamed Item
- The intervals of the lattice of recursively enumerable sets determined by major subsets
- An easy priority-free proof of a theorem of Friedberg
- Automorphisms of the lattice of recursively enumerable sets: Orbits
- On some games which are relevant to the theory of recursively enumerable sets
- The elementary theory of recursively enumerable sets
This page was built for publication: Diagonals and -maximal sets
