The limitations of cupping in the local structure of the enumeration degrees (Q2267755)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5676429
Language Label Description Also known as
default for all languages
No label defined
    English
    The limitations of cupping in the local structure of the enumeration degrees
    scientific article; zbMATH DE number 5676429

      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
      0 references

      Identifiers