Journal of Symbolic Logic 41 (2):513-530 (1976)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2272252
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 63,339
Through your library

References found in this work BETA

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Degrees of Unsolvability.Leonard P. Sasso - 1975 - Journal of Symbolic Logic 40 (3):452-453.

Add more references

Citations of this work BETA

The Density of the Nonbranching Degrees.Peter A. Fejer - 1983 - Annals of Pure and Applied Logic 24 (2):113-130.
Maximal Theories.R. G. Downey - 1987 - Annals of Pure and Applied Logic 33 (3):245-282.
Friedberg Splittings of Recursively Enumerable Sets.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 59 (3):175-199.

View all 8 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
230 ( #43,082 of 2,448,748 )

Recent downloads (6 months)
2 ( #301,105 of 2,448,748 )

How can I increase my downloads?

Downloads

My notes