Recursively Enumerable Degrees and the Degrees Less Than 0

Journal of Symbolic Logic 35 (4):589-589 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
Complementation in the Turing degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Splittings of 0' into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
The distribution of the generic recursively enumerable degrees.Ding Decheng - 1992 - Archive for Mathematical Logic 32 (2):113-135.
Incomparable prime ideals of recursively enumerable degrees.William C. Calhoun - 1993 - Annals of Pure and Applied Logic 63 (1):39-56.
1-Generic splittings of computably enumerable degrees.Guohua Wu - 2006 - Annals of Pure and Applied Logic 138 (1):211-219.

Analytics

Added to PP
2015-02-05

Downloads
18 (#785,610)

6 months
7 (#350,235)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Avoiding uniformity in the Δ 2 0 enumeration degrees.Liliana Badillo & Charles M. Harris - 2014 - Annals of Pure and Applied Logic 165 (9):1355-1379.

Add more citations

References found in this work

No references found.

Add more references