Definable Encodings in the Computably Enumerable Sets
From MaRDI portal
Recommendations
- ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
- The nonlow computably enumerable degrees are not invariant in \(\mathcal{E}\)
- On the orbits of computably enumerable sets
- The Δ₃⁰-automorphism method and noninvariant classes of degrees
- On orbits, of prompt and low computably enumerable sets
Cites work
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Coding in the partial order of enumerable sets
- Degrees of recursively enumerable sets which have no maximal supersets
- Splitting properties and jump classes
- The Δ₃⁰-automorphism method and noninvariant classes of degrees
- There is no fat orbit
- r-maximal major subsets
- d-simple sets, small sets, and degree classes
Cited in
(11)- Invariant Constructions of Simple and Maximal Sets
- scientific article; zbMATH DE number 1531936 (Why is no real title available?)
- Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
- Some recent research directions in the computably enumerable sets
- ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
- Computably enumerable sets and related issues
- Extending and interpreting Post's programme
- Extension theorems, orbits, and automorphisms of the computably enumerable sets
- scientific article; zbMATH DE number 5000345 (Why is no real title available?)
- Isomorphisms of splits of computably enumerable sets
- Some properties of invariant sets
This page was built for publication: Definable Encodings in the Computably Enumerable Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508281)
