Definable Encodings in the Computably Enumerable Sets
From MaRDI portal
Publication:4508281
DOI10.2307/421206zbMath0977.03022OpenAlexW1980476861MaRDI QIDQ4508281
Publication date: 9 January 2002
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.6252
Related Items (4)
Extending and interpreting Post's programme ⋮ Isomorphisms of splits of computably enumerable sets ⋮ Computably enumerable sets and related issues ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets
Cites Work
- d-simple sets, small sets, and degree classes
- Splitting properties and jump classes
- \(r\)-maximal major subsets
- Coding in the partial order of enumerable sets
- There is no fat orbit
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal 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
This page was built for publication: Definable Encodings in the Computably Enumerable Sets
