Joins and meets in the partial orders of the computably enumerable ibT- and cl-degrees
From MaRDI portal
computable Lipschitz reducibilitycomputably enumerable setscuppable degreesdegree structureselementary equivalenceidentity-bounded Turing reducibilityjoinsmeets
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Turing machines and related notions (03D10) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30)
Recommendations
- The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent
- On the strongly bounded Turing degrees of the computably enumerable sets
- A join theorem for the computably enumerable degrees
- The ibT degrees of computably enumerable sets are not dense
- Where join preservation fails in the bounded Turing degrees of c.e. sets
Cited in
(9)- The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
- Joins in the strong Weihrauch degrees
- Where join preservation fails in the bounded Turing degrees of c.e. sets
- The ibT degrees of computably enumerable sets are not dense
- Computably enumerable Turing degrees and the meet property
- Where join preservation fails in the bounded Turing degrees of c.e. sets
- On the strongly bounded Turing degrees of the computably enumerable sets
- On the strongly bounded Turing degrees of simple sets
This page was built for publication: Joins and meets in the partial orders of the computably enumerable ibT- and cl-degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417040)
