Almost universal cupping and diamond embeddings (Q408168): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The d.r.e. degrees are not dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: D.R.E. Degrees and the Nondiamond Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Pairs of Recursively Enumerable Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Models of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees with Almost Universal Cupping Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of embeddings in the computably enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation and lattice embeddings / rank
 
Normal rank

Latest revision as of 01:27, 5 July 2024

scientific article
Language Label Description Also known as
English
Almost universal cupping and diamond embeddings
scientific article

    Statements

    Almost universal cupping and diamond embeddings (English)
    0 references
    0 references
    0 references
    29 March 2012
    0 references
    This paper continues the study of cupping in the d.r.e. (2-r.e.) degrees. A d.r.e. degree \(\boldsymbol d\) has the almost universal cupping property if, for every r.e. degree \(\boldsymbol a\), either \(\boldsymbol a < \boldsymbol d\) or \(\boldsymbol a \cup \boldsymbol d = \mathbf 0'\). Cooper's maximal incomplete d.r.e. degree plainly has this property. The principal result is that there is an almost universal cupping degree \(\boldsymbol d\) and a greatest r.e. degree \(\boldsymbol b < \boldsymbol d\) such that \(\boldsymbol b\) is capped by an r.e. degree \(\boldsymbol c\), making \(\boldsymbol b\) and \(\boldsymbol c\) a minimal pair in the d.r.e. degrees. Downey's diamond theorem follows easily. With \(\boldsymbol d\) and \(\boldsymbol c\) as above, a diamond is formed by \(\mathbf 0,\mathbf 0'\), any nonzero d.r.e. degree \(\boldsymbol e \leq \boldsymbol c\), and any incomplete d.r.e. degree \(\boldsymbol f \geq \boldsymbol d\).
    0 references
    0 references
    Turing degrees
    0 references
    Ershov hierarchy
    0 references
    diamond embeddings
    0 references
    almost universal cupping property
    0 references
    0 references