Bounding and nonbounding minimal pairs in the enumeration degrees

S. Barry Cooper; Angsheng Li; Andrea Sorbi; Yue Yang

doi:10.2178/jsl/1122038912

Bounding and nonbounding minimal pairs in the enumeration degrees

S. Barry Cooper^*
, Angsheng Li
, Andrea Sorbi
, Yue Yang

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

We show that every nonzero Δ₂⁰ e-degree bounds a minimal pair. On the other hand, there exist ∑₂⁰ e-degrees which bound no minimal pair.

Original language	English
Pages (from-to)	741-766
Number of pages	26
Journal	Journal of Symbolic Logic
Volume	70
Issue number	3
DOIs	https://doi.org/10.2178/jsl/1122038912
State	Published - Sep 2005
Externally published	Yes

Access to Document

10.2178/jsl/1122038912

Cite this

@article{f2260356c9a44a35be75c58f48a8661c,

title = "Bounding and nonbounding minimal pairs in the enumeration degrees",

abstract = "We show that every nonzero Δ20 e-degree bounds a minimal pair. On the other hand, there exist ∑20 e-degrees which bound no minimal pair.",

author = "Cooper, \{S. Barry\} and Angsheng Li and Andrea Sorbi and Yue Yang",

year = "2005",

month = sep,

doi = "10.2178/jsl/1122038912",

language = "英语",

volume = "70",

pages = "741--766",

journal = "Journal of Symbolic Logic",

issn = "0022-4812",

publisher = "Cambridge University Press",

number = "3",

}

TY - JOUR

T1 - Bounding and nonbounding minimal pairs in the enumeration degrees

AU - Cooper, S. Barry

AU - Li, Angsheng

AU - Sorbi, Andrea

AU - Yang, Yue

PY - 2005/9

Y1 - 2005/9

N2 - We show that every nonzero Δ20 e-degree bounds a minimal pair. On the other hand, there exist ∑20 e-degrees which bound no minimal pair.

AB - We show that every nonzero Δ20 e-degree bounds a minimal pair. On the other hand, there exist ∑20 e-degrees which bound no minimal pair.

UR - https://www.scopus.com/pages/publications/24644456979

U2 - 10.2178/jsl/1122038912

DO - 10.2178/jsl/1122038912

M3 - 文章

AN - SCOPUS:24644456979

SN - 0022-4812

VL - 70

SP - 741

EP - 766

JO - Journal of Symbolic Logic

JF - Journal of Symbolic Logic

IS - 3

ER -

Bounding and nonbounding minimal pairs in the enumeration degrees

Abstract

Access to Document

Other files and links

Cite this