Title
Bounding and nonbounding minimal pairs in the enumeration degrees
Abstract
We show that every nonzero Delta(0)(2) e-degree bounds a minimal pair. On the other hand. there exist Sigma(0)(2) e-degrees which bound no minimal pair.
Year
DOI
Venue
2005
10.2178/jsl/1122038912
JOURNAL OF SYMBOLIC LOGIC
Keywords
DocType
Volume
null
Journal
70
Issue
ISSN
Citations 
3
0022-4812
7
PageRank 
References 
Authors
1.18
5
4
Name
Order
Citations
PageRank
S. Barry Cooper158685.71
Angsheng Li231843.06
Andrea Sorbi320841.08
Yue Yang4154.35