A hierarchy for cuppable degrees (Q1584492)

From MaRDI portal
Revision as of 04:00, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A hierarchy for cuppable degrees
scientific article

    Statements

    A hierarchy for cuppable degrees (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2001
    0 references
    A c.e. degree \({\mathbf a}\) is called cuppable if there is a c.e. degree \({\mathbf b}\neq\mathbf{0}'\) such that \({\mathbf a}\vee {\mathbf b}= \mathbf{0}'\). A c.e. degree \({\mathbf a}\) is called \(\text{low}_n\)-cuppable, \(n>0\), if there is a \(\text{low}_n\) c.e. degrees \({\mathbf c}\) such that \({\mathbf a}\vee {\mathbf c}=\mathbf{0}'\). Let \(\text{LC}_n\) be the set of all \(\text{low}_n\)-cuppable c.e. degrees. In this paper it is proved that \(\text{LC}_1 \subset \text{LC}_2\).
    0 references
    computably enumerable degrees
    0 references
    \(\text{low}_n\)-cuppable degrees
    0 references

    Identifiers