Degrees of Unsolvability Complementary between Recursively Enumerable Degrees, Part I

Journal of Symbolic Logic 40 (1):86-86 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272284

Links

PhilArchive



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

External links

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

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.
The discontinuity of splitting in the recursively enumerable degrees.S. Barry Cooper & Xiaoding Yi - 1995 - Archive for Mathematical Logic 34 (4):247-256.
Mass problems and almost everywhere domination.Stephen G. Simpson - 2007 - Mathematical Logic Quarterly 53 (4):483-492.
Splittings of 0' into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.
Undecidability and 1-types in the recursively enumerable degrees.Klaus Ambos-Spies & Richard A. Shore - 1993 - Annals of Pure and Applied Logic 63 (1):3-37.
Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability.R. M. Friedberg - 1958 - Journal of Symbolic Logic 23 (2):225-226.
The distribution of the generic recursively enumerable degrees.Ding Decheng - 1992 - Archive for Mathematical Logic 32 (2):113-135.
The Fine Structure of Degrees of Unsolvability of Recursively Enumerable Sets.R. M. Friedberg - 1963 - Journal of Symbolic Logic 28 (2):166-166.
Incomparable prime ideals of recursively enumerable degrees.William C. Calhoun - 1993 - Annals of Pure and Applied Logic 63 (1):39-56.
Review: Donald A. Martin, Classes of Recursively Enumerable Sets and Degrees of Unsolvability. [REVIEW]K. Appel - 1967 - Journal of Symbolic Logic 32 (4):528-528.
Partial Results Regarding Word Problems and Recursively Enumerable Degrees of Unsolvability.William W. Boone - 1963 - Journal of Symbolic Logic 28 (4):292-292.
The Post-Lineal theorems for arbitrary recursively enumerable degrees of unsolvability.Ann H. Ihrig - 1965 - Notre Dame Journal of Formal Logic 6 (1):54-72.
Word Problems and Recursively Enumerable Degrees of Unsolvability. An Emendation.William W. Boone & Donald J. Collins - 1974 - Journal of Symbolic Logic 39 (1):184-185.

Analytics

Added to PP
2015-02-05

Downloads
11 (#1,120,716)

6 months
2 (#1,221,975)

Historical graph of downloads
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