Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability

Journal of Symbolic Logic 23 (2):225-226 (1958)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,553

External links

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

Through your library

Analytics

Added to PP
2015-02-05

Downloads
22 (#984,773)

6 months
9 (#519,282)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
The density of the nonbranching degrees.Peter A. Fejer - 1983 - Annals of Pure and Applied Logic 24 (2):113-130.
Parameter definability in the recursively enumerable degrees.André Nies - 2003 - Journal of Mathematical Logic 3 (01):37-65.

View all 20 citations / Add more citations

References found in this work

No references found.

Add more references