Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees

Journal of Symbolic Logic 70 (3):741 - 766 (2005)
Abstract
We show that every nonzero $\Delta _{2}^{0}$ e-degree bounds a minimal pair. On the other hand, there exist $\Sigma _{2}^{0}$ e-degrees which bound no minimal pair
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1122038912
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,188
Through your library
References found in this work BETA
Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125.
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (6):537-560.

Add more references

Citations of this work BETA
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.

Add more citations

Similar books and articles
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
On Minimal Pairs of Enumeration Degrees.Kevin McEvoy & S. Barry Cooper - 1985 - Journal of Symbolic Logic 50 (4):983-1001.
On a Problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
On the Definable Ideal Generated by Nonbounding C.E. Degrees.Liang Yu & Yue Yang - 2005 - Journal of Symbolic Logic 70 (1):252 - 270.
Bounding Nonsplitting Enumeration Degrees.Thomas F. Kent & Andrea Sorbi - 2007 - Journal of Symbolic Logic 72 (4):1405 - 1417.
Structural Properties and Σ02 Enumeration Degrees.André Nies & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):285 - 292.
Noncappable Enumeration Degrees Below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
Minimal Pairs and High Recursively Enumerable Degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
Bounding Minimal Pairs.A. H. Lachlan - 1979 - Journal of Symbolic Logic 44 (4):626-642.
Jumps of Quasi-Minimal Enumeration Degrees.Kevin McEvoy - 1985 - Journal of Symbolic Logic 50 (3):839-848.

Monthly downloads

Added to index

2010-08-24

Total downloads

10 ( #424,116 of 2,153,858 )

Recent downloads (6 months)

1 ( #398,274 of 2,153,858 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums