A join theorem for the computably enumerable degrees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- A limit on relative genericity in the recursively enumerable sets
- An almost deep degree
- Degrees joining to 0′
- Interpretability and Definability in the Recursively Enumerable Degrees
- Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable
Cited in
(15)- Joining to high degrees via noncuppables
- Decomposability of low 2-computably enumerable degrees and Turing jumps in the Ershov hierarchy
- Computably enumerable Turing degrees and the meet property
- Another note on the join property
- Isolated 2-computably enumerable \(Q\)-degrees
- Joining non-low C.E. sets with diagonally non-computable functions
- Elementary differences among jump classes
- Joining to High Degrees
- A high c.e. degree which is not the join of two minimal degrees
- A hierarchy for the plus cupping Turing degrees
- The Join Levels of the Trotter-Weil Hierarchy Are Decidable
- Joins and meets in the partial orders of the computably enumerable ibT- and cl-degrees
- The \(\text{low}_n\) and \(\text{low}_m\) r.e. degrees are not elementarily equivalent
- A semilattice generated by superlow computably enumerable degrees
- The nonlow computably enumerable degrees are not invariant in \(\mathcal{E}\)
This page was built for publication: A join theorem for the computably enumerable degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813778)
