A high noncuppable \({\Sigma^0_2}\) \(e\)-degree (Q938229): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jumps of quasi-minimal enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal pairs of enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946105 / rank
 
Normal rank

Revision as of 13:50, 28 June 2024

scientific article
Language Label Description Also known as
English
A high noncuppable \({\Sigma^0_2}\) \(e\)-degree
scientific article

    Statements

    A high noncuppable \({\Sigma^0_2}\) \(e\)-degree (English)
    0 references
    0 references
    18 August 2008
    0 references
    A \(\Sigma_2^0\)-enumeration degree (e-degree) \({\mathbf a}\) is cuppable if there exists a \(\Sigma_2^0\) e-degree \({\mathbf b}<{\mathbf 0}_e'\) such that \({\mathbf a}\cup{\mathbf b}={\mathbf 0}_e'\). In the paper under review the author proves that there exists a high noncuppable \(\Sigma_2^0\) e-degree. Since every \(\Delta_2^0\) e-degree is cuppable it follows that there exists a high \(\Sigma_2^0\) e-degree without \(\Delta_2^0\) predecessors.
    0 references
    enumeration degrees
    0 references
    cuppable degrees
    0 references
    high degrees
    0 references

    Identifiers