The Complexity of Orbits of Computably Enumerable Sets
From MaRDI portal
Publication:5387296
DOI10.2178/bsl/1208358844zbMath1142.03022OpenAlexW2761813262MaRDI QIDQ5387296
Peter A. Cholak, Leo Harrington, Rodney G. Downey
Publication date: 8 May 2008
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/bsl/1208358844
Related Items (1)
Cites Work
- The intervals of the lattice of recursively enumerable sets determined by major subsets
- d-simple sets, small sets, and degree classes
- Automorphisms of the lattice of recursively enumerable sets: Orbits
- The translation theorem
- Computable structures and the hyperarithmetical hierarchy
- Some orbits for \({\mathcal E}\)
- There is no fat orbit
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- The upper semi-lattice of degrees of recursive unsolvability
- A criterion for completeness of degrees of unsolvability
- Invariance in ℰ* and ℰ_{Π}
- On the orbits of hyperhypersimple sets
- Jumps of Hemimaximal Sets
- Post's program and incomplete recursively enumerable sets.
- Codable sets and orbits of computably enumerable sets
- Isomorphisms of splits of computably enumerable sets
- INVARIANCE AND NONINVARIANCE IN THE LATTICE OF $\Pi_1^0$ CLASSES
- Automorphisms of the lattice of recursively enumerable sets
- ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
- Π11 relations and paths through
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- The Δ₃⁰-automorphism method and noninvariant classes of degrees
- Recursively enumerable sets of positive integers and their decision problems
This page was built for publication: The Complexity of Orbits of Computably Enumerable Sets
