Categories

Keywords

Reprint years

DOI

10.2307/2271111

Other Versions

No versions found

Links

PhilArchive

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

Gerald E. Sacks. A minimal degree less than O'. Bulletin of the American Mathematical Society, vol. 67 (1961), pp. 416–419. [REVIEW]Robert W. Robinson - 1969 - Journal of Symbolic Logic 34 (2):295-295.
Gerald E. Sacks. Metarecursively enumerable sets and admissible ordinals. Bulletin of the American Mathematical Society, vol. 72 , pp. 59–64. - Gerald E. Sacks. Post's problem, admissible ordinals, and regularity. Transactions of the American Mathematical Society, vol. 124 , pp. 1–23. - Gerald E. Sacks. Metarecursion theory. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 243–263. - Graham C. DriscollJr., Metarecursively enumerable sets and their metadegrees. The Journal of symbolic logic, vol. 33 , pp. 389–11.Richard A. Platek - 1969 - Journal of Symbolic Logic 34 (1):115-116.
Gerald E. Sacks. On the degrees less than 0′. Annals of mathematics, second series, vol. 77 , pp. 211–231. - Gerald E. Sacks. Correction to “On the degrees less than 0′.”Annals of mathematics, second series, vol. 78 , p. 204. [REVIEW]Marian Boykan Pour-El - 1964 - Journal of Symbolic Logic 29 (1):60.
Gerald E. Sacks. On a theorem of Lachlan and Martin. Proceedings of the American Mathematical Society, vol. 18 , pp. 140–141. [REVIEW]C. E. M. Yates - 1968 - Journal of Symbolic Logic 32 (4):529.
Gerald E. Sacks. Recursive enumerability and the jump operator. Transactions of the American Mathematical Society, vol. 108 , pp. 223–239. [REVIEW]Donald L. Kreider - 1964 - Journal of Symbolic Logic 29 (4):204.
Review: Gerald E. Sacks, On the Degrees Less than 0'. [REVIEW]Marian Boykan Pour-El - 1964 - Journal of Symbolic Logic 29 (1):60-60.
Sacks Gerald E.. Forcing with perfect closed sets. Axiomatic set theory, Proceedings of symposia in pure mathematics, vol. 13 part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 331–355.J. R. Shoenfield - 1974 - Journal of Symbolic Logic 39 (2):330-330.
G. Kreisel and Gerald E. Sacks. Metarecursive sets. The journal of symbolic logic, vol. 30 , pp. 318–338.Richard A. Platek - 1968 - Journal of Symbolic Logic 33 (4):622-623.
In memoriam: Gerald E. Sacks, 1933–2019.Manuel Lerman & Theodore A. Slaman - 2022 - Bulletin of Symbolic Logic 28 (1):150-155.
Gerald E. Sacks. Higher recursion theory. Perspectives in mathematical logic. Springer-Verlag, Berlin etc. 1990, xv + 344 pp. [REVIEW]Dag Normann - 1992 - Journal of Symbolic Logic 57 (2):761-762.

Analytics

Added to PP
2015-02-05

Downloads
53 (#1,123,870)

6 months
11 (#1,082,321)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Enumeration reducibility and partial degrees.John Case - 1971 - Annals of Mathematical Logic 2 (4):419-439.
Complementing below recursively enumerable degrees.Rl Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):15-32.
Degree structures: Local and global investigations.Richard A. Shore - 2006 - Bulletin of Symbolic Logic 12 (3):369-389.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.

View all 8 citations / Add more citations

References found in this work

No references found.

Add more references