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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

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]Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):295-295.
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.
Manuel Lerman. A framework for priority arguments. Lecture Notes in Logic, vol. 34. Cambridge University Press, New York, 2010, xvi + 176 pp. [REVIEW]George Barmpalias - 2011 - Bulletin of Symbolic Logic 17 (3):464-467.
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.
Review: Gerald E. Sacks, On the Degrees Less than 0'. [REVIEW]Marian Boykan Pour-El - 1964 - Journal of Symbolic Logic 29 (1):60-60.
Review: Gerald E. Sacks, A Maximal Set which is not Complete. [REVIEW]K. Appel - 1967 - Journal of Symbolic Logic 32 (4):528-528.
Five papers on reverse mathematics and Ramsey-theoretic principles - C. T. Chong, Theodore A. Slaman, and Yue Yang, The metamathematics of Stable Ramsey’s Theorem for Pairs. Journal of the American Mathematical Society, vol. 27 (2014), no. 3, pp. 863–892. - Manuel Lerman, Reed Solomon, and Henry Towsner, Separating principles below Ramsey’s Theorem for Pairs. Journal of Mathematical Logic, vol. 13 (2013), no. 2, 1350007, 44 pp. - Jiayi Liu, $RT2^^2$ does not imply WKL 0. Journal of Symbolic Logic, vol. 77 (2012), no. 2, pp. 609–620. - Lu Liu, Cone avoiding closed sets. Transactions of the American Mathematical Society, vol. 367 (2015), no. 3, pp. 1609–1630. - Wei Wang, Some logically weak Ramseyan theorems_. Advances in Mathematics, vol. 261 (2014), pp. 1–25. [REVIEW]Denis R. Hirschfeldt - 2016 - Bulletin of Symbolic Logic 22 (4):526-530.
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: Anne sjerp Troelstra 1939–2019.Dick de Jongh & Joan Rand Moschovakis - 2020 - Bulletin of Symbolic Logic 26 (3-4):293-295.
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.

Analytics

Added to PP
2022-04-07

Downloads
19 (#1,120,317)

6 months
4 (#864,415)

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.
On the non-enumerability of L.G. E. Sacks - 2016 - Journal of Symbolic Logic 81 (4):1396-1404.

Add more references