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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4944900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial degrees and the density problem. Part 2: The enumeration degrees of the <i>Σ</i><sub>2</sub> sets are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Maximum Principle for Degenerate Elliptic Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(n\)-rea enumeration degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite cupping sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching in the enumeration degrees of the \(\Sigma_2^0\) sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees joining to <b>0</b>′ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cupping Classes of $\Sigma^0_2$ Enumeration Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′ / rank
 
Normal rank

Latest revision as of 12:53, 2 July 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
    0 references
    enumeration degrees
    0 references
    cupping
    0 references
    local structure
    0 references
    0 references