The limitations of cupping in the local structure of the enumeration degrees (Q2267755): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Mariya Ivanova Soskova / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Roland Sh. Omanadze / rank
 
Normal rank

Revision as of 17:41, 10 February 2024

scientific article
Language Label Description Also known as
English
The limitations of cupping in the local structure of the enumeration degrees
scientific article

    Statements

    The limitations of cupping in the local structure of the enumeration degrees (English)
    0 references
    2 March 2010
    0 references
    In an upper semilattice with greatest element \(\langle{\mathcal A},\leq,\vee,1\rangle\) we say that an element \textbf{a} is cuppable if there exists an element \({\mathbf b} \neq 1\) such that \({\mathbf a}\vee {\mathbf b}=1\) . The element \textbf{b} is called a cupping partner for \textbf{a}. In this paper the author considers cupping properties of the local degree structure of all enumeration degrees reducible to \({\mathbf 0}'_e\), \(D_e( \leq {\mathbf 0}'_e)\), and the following results are obtained: 1.) A sequence of sets containing representatives of cupping partners for every nonzero \(\Delta^{0}_2\) enumeration degree cannot have a \(\Delta^0_2\) enumeration. 2.) Let \textbf{a} be an incomplete \(\Sigma_2^0\) enumeration degree. There exists a nonzero \(3\)-c.e. enumeration degree \({\mathbf b}\) such that \({\mathbf a} \vee {\mathbf b}\neq {\mathbf 0}'_e\).
    0 references
    enumeration degrees
    0 references
    cupping
    0 references
    local structure
    0 references

    Identifiers