Initial segments of one-one degrees
From MaRDI portal
Publication:2535239
Cited in
(11)- Hyper-hypersimple \(m\)-degrees
- Initial segments of the degrees of ceers
- Embeddings in the Strong Reducibilities Between 1 and npm
- The structure of computably enumerable preorder relations
- Minimal weak truth table degrees and computably enumerable Turing degrees
- Universal computably enumerable equivalence relations
- Undecidability and initial segments of the (r.e.) tt-degrees
- 1-reducibility inside an m-degree with a maximal set
- The index sets of m-degrees
- On the degree structure of equivalence relations under computable reducibility
- Strong reducibilities
This page was built for publication: Initial segments of one-one degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2535239)