Gerald E. Sacks

from Wikipedia, the free encyclopedia

Gerald Enoch Sacks (born 1933 in Brooklyn ; † October 4, 2019 in Falmouth , Maine ) was an American mathematical logician .

Sacks received his PhD in 1961 under John Barkley Rosser at Cornell University (On Suborderings of Degrees of Recursive Unsolvability). From 1962 he was an assistant professor and then an associate professor at Cornell University. In 1961/62 and 1974/75 he was at the Institute for Advanced Study . From 1967 he was a professor at the Massachusetts Institute of Technology (until 2006 he was Professor Emeritus there) and at the same time from 1972 professor at Harvard University . He was visiting professor at Caltech (1983/83) and at the University of Chicago (1988/89).

In 1966/67 he was a Guggenheim Fellow and in 1979 a Senior Fulbright-Hayes Scholar. In 1970 he was invited speaker at the International Congress of Mathematicians in Nice ( Recursion in objects of finite type ) and in 1962 in Stockholm ( Recursively enumerable degrees ).

His PhD students include Harvey Friedman , Sy Friedman , Leo Harrington , Richard A. Shore , Theodore Slaman , Stephen G. Simpson (Professor at Pennsylvania State University), Lenore Blum , RW Robinson (Professor at the University of Georgia).

Sacks was particularly concerned with recursion theory . His density theorem states that the recursively enumerable Turing degrees (also called degrees of unsolvability ) are close together. A forcing method is named after him (Sacks Forcing).

Fonts

  • Degrees of unsolvability. Princeton University Press 1963, 1966.
  • Saturated Model Theory. Benjamin, 1972.
  • Higher recursion theory. Springer, 1990.
  • Selected Logic Papers. World Scientific, 1999.
  • Mathematical Logic in the 20th Century. World Scientific, 2003.

Web links

Individual evidence

  1. ↑ Gerald Enoch Sacks, Professor Emeritus of Mathematical Logic at MIT and Harvard 1933-2019. Massachusetts Institute of Technology, Department of Mathematics, October 28, 2019, accessed November 24, 2019 .
  2. ↑ The recursively enumerable degrees are dense. Annals of Mathematics, Vol. 80, 1964, p. 300.
  3. ^ Sacks: Forcing with perfect closed sets. Proc.Symp.Pure Math. Vol. 13, Part 1 (Axiomatic Set Theory), 1971, p. 331.
personal data
SURNAME Sacks, Gerald E.
ALTERNATIVE NAMES Sacks, Gerald Enoch (full name)
BRIEF DESCRIPTION American mathematical logician
DATE OF BIRTH 1933
PLACE OF BIRTH Brooklyn
DATE OF DEATH 4th October 2019
Place of death Falmouth (Maine)