Maximal contiguous degrees
From MaRDI portal
Recommendations
Cites work
- Classical recursion theory. Vol. II
- Highness and bounding minimal pairs
- Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
- Lattice nonembeddings and initial segments of the recursively enumerable degrees
- Localization of a theorem of Ambos-Spies and the strong anti-splitting property
- Splitting theorems in recursion theory
- Structural interactions of the recursively enumerable T- and W-degrees
- The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
- The weak truth table degrees of recursively enumerable sets
- Wtt-degrees and T-degrees of r.e. sets
Cited in
(11)- The contiguity in R/M.
- Characterizing the continuous degrees
- On the strongly bounded Turing degrees of the computably enumerable sets
- Hierarchy of Computably Enumerable Degrees II
- Contiguity and distributivity in the enumerable Turing degrees
- A hierarchy of computably enumerable degrees
- scientific article; zbMATH DE number 218585 (Why is no real title available?)
- Minimal weak truth table degrees and computably enumerable Turing degrees
- scientific article; zbMATH DE number 3895050 (Why is no real title available?)
- Maximality and collapse in the hierarchy of -c.a. degrees
- Embeddings of N₅ and the contiguous degrees
This page was built for publication: Maximal contiguous degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4532623)