Minimal Complements for Degrees below 0´

Journal of Symbolic Logic 69 (4):937 - 966 (2004)
  Copy   BIBTEX

Abstract

It is shown that for every (Turing) degree 0 < a < 0´ there is a minimal degree m < 0´ such that a ∨ m = 0´ (and therefore a ∧ m = 0)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Minimal complements for degrees below 0'.Andrew Lewis - 2004 - Journal of Symbolic Logic 69 (4):937-966.
The minimal complementation property above 0′.Andrew E. M. Lewis - 2005 - Mathematical Logic Quarterly 51 (5):470-492.
Degrees joining to 0'. [REVIEW]David B. Posner & Robert W. Robinson - 1981 - Journal of Symbolic Logic 46 (4):714 - 722.
Properly Σ2 minimal degrees and 0″ complementation.S. Cooper, Andrew Lewis & Yue Yang - 2005 - Mathematical Logic Quarterly 51 (3):274-276.
A weakly 2-generic which Bounds a minimal degree.Rodney G. Downey & Satyadev Nandakumar - 2019 - Journal of Symbolic Logic 84 (4):1326-1347.
Jump Operator and Yates Degrees.Guohua Wu - 2006 - Journal of Symbolic Logic 71 (1):252 - 264.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Turing degrees and many-one degrees of maximal sets.Manuel Lerman - 1970 - Journal of Symbolic Logic 35 (1):29-40.

Analytics

Added to PP
2010-08-24

Downloads
44 (#372,168)

6 months
8 (#415,167)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The minimal complementation property above 0′.Andrew E. M. Lewis - 2005 - Mathematical Logic Quarterly 51 (5):470-492.

Add more citations

References found in this work

No references found.

Add more references