Definable properties of the computably enumerable sets
From MaRDI portal
Publication:1295410
DOI10.1016/S0168-0072(97)00069-9zbMath0928.03051MaRDI QIDQ1295410
Publication date: 12 January 2000
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
automorphismcompletenessdefinabilityTuring reducibilitycomputably enumerable setsinclusion orderingLachlan-type gamespromptly simple
Related Items (6)
Duality, non-standard elements, and dynamic properties of r.e. sets ⋮ There is no fat orbit ⋮ Computably enumerable sets that are automorphic to low sets ⋮ The nonlow computably enumerable degrees are not invariant in $\mathcal {E}$ ⋮ Orbits of computably enumerable sets: Low sets can avoid an upper cone ⋮ Definable incompleteness and Friedberg splittings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- d-simple sets, small sets, and degree classes
- Splitting properties and jump classes
- Automorphisms of the lattice of recursively enumerable sets: Orbits
- The dense simple sets are orbit complete with respect to the simple sets
- Cappable recursively enumerable degrees and Post's program
- The translation theorem
- On some games which are relevant to the theory of recursively enumerable sets
- There is no fat orbit
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- On the orbits of hyperhypersimple sets
- Variations on promptly simple sets
- Recursively enumerable generic sets
- Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
- Post's program and incomplete recursively enumerable sets.
- Automorphisms of the lattice of recursively enumerable sets
- Codable sets and orbits of computably enumerable sets
- Definability, Automorphisms, and Dynamic Properties of 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
- Computability and Recursion
This page was built for publication: Definable properties of the computably enumerable sets
