Some orbits for \({\mathcal E}\)
From MaRDI portal
Publication:1840464
DOI10.1016/S0168-0072(00)00060-9zbMath0969.03051MaRDI QIDQ1840464
Eberhard Herrmann, Peter A. Cholak, Rodney G. Downey
Publication date: 30 September 2001
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Related Items (6)
On Splits of Computably Enumerable Sets ⋮ The Complexity of Orbits of Computably Enumerable Sets ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets ⋮ On the orbits of computably enumerable sets ⋮ -MAXIMAL SETS ⋮ Orbits of computably enumerable sets: Low sets can avoid an upper cone
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A non-inversion theorem for the jump operator
- Automorphisms of the lattice of recursively enumerable sets: Orbits
- Minimal 1-degrees and truth-table reducibility
- Classical recursion theory. Vol. II
- Splitting theorems in recursion theory
- The translation theorem
- There is no fat orbit
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- A jump class of noncappable degrees
- Recursively enumerable generic sets
- Jumps of Hemimaximal Sets
- Diagonals and semihyperhypersimple sets
- Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
- Post's program and incomplete recursively enumerable sets.
- Minimal pairs and high recursively enumerable degrees
- Diagonals and -maximal sets
- Automorphisms of the lattice of recursively enumerable sets
- Codable sets and orbits of computably enumerable sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Recursion, metarecursion, and inclusion
- The Δ₃⁰-automorphism method and noninvariant classes of degrees
This page was built for publication: Some orbits for \({\mathcal E}\)
