In memoriam: Gerald E. Sacks, 1933–2019

&
Bulletin of Symbolic Logic 28 (1):150-155 (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/bsl.2022.8

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

Conjectures and questions from Gerald Sacks's Degrees of Unsolvability.Richard A. Shore - 1997 - Archive for Mathematical Logic 36 (4-5):233-253.
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. 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. [REVIEW]Richard A. Platek - 1969 - Journal of Symbolic Logic 34 (1):115-116.
In Memoriam: Mark Sacks (29 December 1953–17 June 2008).Sebastian Gardner Axel Honneth - 2009 - European Journal of Philosophy 17 (1):159-166.
Preface.Gerald E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):341.
On the Degrees Less than 0'.Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (1):60-60.
Selected Logic Papers.Gerald E. Sacks - 2001 - Studia Logica 69 (3):449-450.
Gerald E. Sacks. A minimal degree less than O'. Bulletin of the American Mathematical Society, vol. 67 (1961), pp. 416–419. [REVIEW]Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):295-295.
Measure-theoretic uniformity.Gerald E. Sacks - 1969 - In Kurt Gödel, Jack J. Bulloff, Thomas C. Holyoke & Samuel Wilfred Hahn (eds.), Foundations of Mathematics. New York: Springer. pp. 51--57.
Liu Shih-Chao. On many-one degrees.Gerald E. Sacks - 1996 - Journal of Symbolic Logic 31 (3):512-513.
Metarecursive Sets.G. Kreisel & Gerald E. Sacks - 1968 - Journal of Symbolic Logic 33 (4):622-623.
Recursive Enumerability and the Jump Operator.Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (4):204-204.
Review: Shih-Chao Liu, On Many-One Degrees. [REVIEW]Gerald E. Sacks - 1966 - Journal of Symbolic Logic 31 (3):512-513.
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.
Review: Gerald E. Sacks, A Maximal Set which is not Complete. [REVIEW]K. Appel - 1967 - Journal of Symbolic Logic 32 (4):528-528.

Analytics

Added to PP
2022-04-07

Downloads
11 (#1,075,532)

6 months
6 (#431,022)

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

The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
The alpha-finite injury method.G. E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):343.
On the non-enumerability of L.G. E. Sacks - 2016 - Journal of Symbolic Logic 81 (4):1396-1404.

Add more references