Leo Harrington
American mathematician
From Wikipedia, the free encyclopedia
Leo Anthony Harrington (born May 17, 1946) is a professor of mathematics at the University of California, Berkeley who works in computability theory, model theory, and set theory.
Leo A. Harrington | |
|---|---|
| |
| Born | May 17, 1946 (age 80) |
| Citizenship | United States |
| Alma mater | MIT |
| Awards | Gödel Lecture (1995) |
| Scientific career | |
| Fields | Mathematics |
| Institutions | University of California, Berkeley |
| Gerald E. Sacks | |
Doctoral students | |
His notable results include proving the Paris–Harrington theorem along with Jeff Paris,[1] showing that if the axiom of determinacy holds for all analytic sets then x# exists for all reals x,[2] and proving with Saharon Shelah that the first-order theory of the partially ordered set of computably enumerable Turing degrees is undecidable.[3]
