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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Guohua Wu / rank
 
Normal rank
Property / review text
 
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\).
Property / review text: 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\). / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Joseph S. Ullian / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03D25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03D28 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6019359 / rank
 
Normal rank
Property / zbMATH Keywords
 
Turing degrees
Property / zbMATH Keywords: Turing degrees / rank
 
Normal rank
Property / zbMATH Keywords
 
Ershov hierarchy
Property / zbMATH Keywords: Ershov hierarchy / rank
 
Normal rank
Property / zbMATH Keywords
 
diamond embeddings
Property / zbMATH Keywords: diamond embeddings / rank
 
Normal rank
Property / zbMATH Keywords
 
almost universal cupping property
Property / zbMATH Keywords: almost universal cupping property / rank
 
Normal rank

Revision as of 17:57, 29 June 2023

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
    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
    Turing degrees
    0 references
    Ershov hierarchy
    0 references
    diamond embeddings
    0 references
    almost universal cupping property
    0 references

    Identifiers