Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312 [Book Review]

Journal of Symbolic Logic 34 (2):294-295 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271110

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,758

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.
A non-splitting theorem for d.r.e. sets.Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (1):17-96.
The Isolated D. R. E. Degrees are Dense in the R. E. Degrees.Geoffrey Laforte - 1996 - Mathematical Logic Quarterly 42 (1):83-103.
The Sacks density theorem and Σ2-bounding.Marcia J. Groszek, Michael E. Mytilinaios & Theodore A. Slaman - 1996 - Journal of Symbolic Logic 61 (2):450 - 467.
The Sacks Density Theorem and $\Sigma_2$-Bounding.Marcia Groszek, Michael Mytilinaios & Theodore Slaman - 1996 - Journal of Symbolic Logic 61 (2):450-467.
Review: R. M. Friedberg, The Fine Structure of Degrees of Unsolvability of Recursively Enumerable Sets. [REVIEW]Gerald E. Sacks - 1963 - Journal of Symbolic Logic 28 (2):166-166.
Review: A. H. Lachlan, The Impossibility of Finding Relative Complements for Recursively Enumerable Degrees. [REVIEW]Gerald E. Sacks - 1971 - Journal of Symbolic Logic 36 (3):539-540.
§ 1. Introduction After seeing the Sacks Density Theorem [Sa2], Shoenfield conjectured [Sh2] that the recursively enumerable (re) degrees R form a dense structure as an upper semi-lattice analogously as the rationals are a dense structure as a linearly. [REVIEW]David P. Miller - 1981 - In M. Lerman, J. H. Schmerl & R. I. Soare (eds.), Logic Year 1979-80, the University of Connecticut, Usa. Springer Verlag. pp. 859--230.
William W. Boone. Word problems and recursively enumerable degrees of unsolvability. An emendation. Annals of mathematics, ser. 2 vol. 94 , pp. 389–391. - Donald J. Collins. Truth-table degrees and the Boone groups. Annals of mathematics, ser. 2 vol. 94 , pp. 392–396. [REVIEW]Charles E. Hughes - 1974 - Journal of Symbolic Logic 39 (1):184-185.
Review: Ann H. Ihrig, The Post-Lineal Theorems for Arbitrary Recursively Enumerable Degrees of Unsolvability. [REVIEW]Gerald E. Sacks - 1967 - Journal of Symbolic Logic 32 (4):529-529.
The recursively enumerable alpha-degrees are dense.Richard A. Shore - 1976 - Annals of Mathematical Logic 9 (1/2):123.
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.
Incomparable prime ideals of recursively enumerable degrees.William C. Calhoun - 1993 - Annals of Pure and Applied Logic 63 (1):39-56.
The continuity of cupping to 0'.Klaus Ambos-Spies, Alistair H. Lachlan & Robert I. Soare - 1993 - Annals of Pure and Applied Logic 64 (3):195-209.
The ibT degrees of computably enumerable sets are not dense.George Barmpalias & Andrew E. M. Lewis - 2006 - Annals of Pure and Applied Logic 141 (1-2):51-60.

Analytics

Added to PP
2016-06-30

Downloads
25 (#649,122)

6 months
6 (#575,766)

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