Definable properties of the computably enumerable sets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1163992 (Why is no real title available?)
- scientific article; zbMATH DE number 841085 (Why is no real title available?)
- scientific article; zbMATH DE number 1390017 (Why is no real title available?)
- Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
- Automorphisms of the lattice of recursively enumerable sets
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
- Automorphisms of the lattice of recursively enumerable sets: Orbits
- Cappable recursively enumerable degrees and Post's program
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Codable sets and orbits of computably enumerable sets
- Computability and Recursion
- Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
- Degrees of recursively enumerable sets which have no maximal supersets
- On some games which are relevant to the theory of recursively enumerable sets
- On the orbits of hyperhypersimple sets
- Post's program and incomplete recursively enumerable sets.
- Recursively enumerable generic sets
- Splitting properties and jump classes
- The dense simple sets are orbit complete with respect to the simple sets
- The translation theorem
- The Δ₃⁰-automorphism method and noninvariant classes of degrees
- There is no fat orbit
- Variations on promptly simple sets
- d-simple sets, small sets, and degree classes
Cited in
(11)- Orbits of computably enumerable sets: Low sets can avoid an upper cone
- scientific article; zbMATH DE number 841085 (Why is no real title available?)
- Definable elements of definable Borel sets
- scientific article; zbMATH DE number 1531936 (Why is no real title available?)
- Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
- There is no fat orbit
- Definable incompleteness and Friedberg splittings
- Duality, non-standard elements, and dynamic properties of r.e. sets
- The nonlow computably enumerable degrees are not invariant in \(\mathcal{E}\)
- scientific article; zbMATH DE number 5000345 (Why is no real title available?)
- Computably enumerable sets that are automorphic to low sets
This page was built for publication: Definable properties of the computably enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295410)
