Minimal complements for degrees below 0'

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

Abstract

It is shown that for every degree 0

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Minimal Complements for Degrees below 0´.Andrew Lewis - 2004 - Journal of Symbolic Logic 69 (4):937 - 966.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
A high c.e. degree which is not the join of two minimal degrees.Matthew B. Giorgi - 2010 - Journal of Symbolic Logic 75 (4):1339-1358.
Properly Σ2 minimal degrees and 0″ complementation.S. Barry Cooper, Andrew E. M. Lewis & Yue Yang - 2005 - Mathematical Logic Quarterly 51 (3):274-276.
The minimal complementation property above 0′.Andrew E. M. Lewis - 2005 - Mathematical Logic Quarterly 51 (5):470-492.
Infima in the d.r.e. degrees.D. Kaddah - 1993 - Annals of Pure and Applied Logic 62 (3):207-263.
Structural properties of Q -degrees of n-c. e. sets.Marat M. Arslanov, Ilnur I. Batyrshin & R. Sh Omanadze - 2008 - Annals of Pure and Applied Logic 156 (1):13-20.
Intervals containing exactly one c.e. degree.Guohua Wu - 2007 - Annals of Pure and Applied Logic 146 (1):91-102.
Bounding and nonbounding minimal pairs in the enumeration degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741-766.
Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741 - 766.
Properly Σ2 minimal degrees and 0″ complementation.S. Cooper, Andrew Lewis & Yue Yang - 2005 - Mathematical Logic Quarterly 51 (3):274-276.
Π10 classes and minimal degrees.Marcia J. Groszek & Theodore A. Slaman - 1997 - Annals of Pure and Applied Logic 87 (2):117-144.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
A minimal pair joining to a plus cupping Turing degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.

Analytics

Added to PP
2017-02-21

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references