Mathematical Logic Quarterly 51 (3):274-276 (2005)

Abstract
We show that there exists a properly Σ2 minimal degree b, and moreover that b can be chosen to join with 0′ to 0″ – so that b is a 0″ complement for every degree a such that 0′ ≤ a < 0″
Keywords minimal degrees  Computability  complementation
Categories (categorize this paper)
DOI 10.1002/malq.200410027
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 64,178
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Finite Cupping Sets.Andrew Lewis - 2004 - Archive for Mathematical Logic 43 (7):845-858.

Add more references

Citations of this work BETA

The Degrees of Bi-Hyperhyperimmune Sets.Uri Andrews, Peter Gerdes & Joseph S. Miller - 2014 - Annals of Pure and Applied Logic 165 (3):803-811.
The Minimal Complementation Property Above 0′.Andrew E. M. Lewis - 2005 - Mathematical Logic Quarterly 51 (5):470-492.

Add more citations

Similar books and articles

The Minimal Complementation Property Above 0′.Andrew E. M. Lewis - 2005 - Mathematical Logic Quarterly 51 (5):470-492.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
Complementation in the Turing Degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
On a Problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
Minimal Complements for Degrees Below 0´.Andrew Lewis - 2004 - Journal of Symbolic Logic 69 (4):937 - 966.
Definability and Initial Segments of C-Degrees.Robert S. Lubarsky - 1988 - Journal of Symbolic Logic 53 (4):1070-1081.
Degrees of Monotone Complexity.William C. Calhoun - 2006 - Journal of Symbolic Logic 71 (4):1327 - 1341.
Degrees Which Do Not Bound Minimal Degrees.Manuel Lerman - 1986 - Annals of Pure and Applied Logic 30 (3):249-276.

Analytics

Added to PP index
2013-12-01

Total views
20 ( #540,530 of 2,455,001 )

Recent downloads (6 months)
1 ( #449,233 of 2,455,001 )

How can I increase my downloads?

Downloads

My notes