Switch to: Citations

References in:

The density of the nonbranching degrees

Peter A. Fejer

Annals of Pure and Applied Logic 24 (2):113-130 (1983)

Add references

You must login to add references.

Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312. [REVIEW]Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):294-295.details Download Export citation Bookmark 38 citations
On the Degrees Less than 0'.Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (1):60-60.details Download Export citation Bookmark 18 citations
Recursively Enumerable Sets of Positive Integers and Their Decision Problems.Emil L. Post - 1945 - Journal of Symbolic Logic 10 (1):18-19.details Download Export citation Bookmark 44 citations
The infinite injury priority method.Robert I. Soare - 1976 - Journal of Symbolic Logic 41 (2):513-530.details Download Export citation Bookmark 13 citations
A recursively enumerable degree which will not split over all lesser ones.Alistair H. Lachlan - 1976 - Annals of Mathematical Logic 9 (4):307.details Download Export citation Bookmark 39 citations
The Upper Semi-Lattice of Degrees of Recursive Unsolvability.S. C. Kleene & Emil L. Post - 1956 - Journal of Symbolic Logic 21 (4):407-408.details Download Export citation Bookmark 13 citations
(1 other version)Review: J. R. Shoenfield, J. W. Addison, Leon Henkin, Alfred Tarski, Applications of Model Theory to Degrees of Unsolvability. [REVIEW]Gerald E. Sacks - 1972 - Journal of Symbolic Logic 37 (3):610-611.details Download Export citation Bookmark 4 citations
Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability.R. M. Friedberg - 1958 - Journal of Symbolic Logic 23 (2):225-226.details Download Export citation Bookmark 22 citations

1