Leo Harrington

Infobox academic
name = Leo A. Harrington
box_width =


image_width =
caption =
birth_date =
birth_place =
death_date =
death_place =
residence =
citizenship = USA
nationality =
ethnicity =
field = Mathematics
work_institutions = University of California, Berkeley
alma_mater = MIT
doctoral_advisor = Gerald E. Sacks
doctoral_students =
known_for =
influences =
influenced =
prizes =
religion =
footnotes =

Leo Anthony Harrington is a professor of mathematics at the University of California, Berkeley who works in
recursion theory, model theory, and set theory.

* Harrington and Jeff Paris proved the Paris–Harrington theorem.Citation
first = J.
last = Paris
first2 = L.
last2 = Harrington
contribution = A Mathematical Incompleteness in Peano Arithmetic
editor-first = J.
editor-last = Barwise
year = 1977
title = Handbook of Mathematical Logic
pages = 1133-1142
publisher = North-Holland]

* Harrington showed that if the Axiom of Determinacy holds for all analytic sets then x^# exists for all reals x.citation
author = Harrington, L.
year = 1978
title = Analytic Determinacy and 0^#
journal = Journal of Symbolic Logic
volume = 43
issue = 4
pages = 685–693
doi = 10.2307/2273508
url = http://links.jstor.org/sici?sici=0022-4812(197812)43%3A4%3C685%3AADA%3E2.0.CO%3B2-J]

* Harrington and Saharon Shelah showed that the first order theory of the recursively enumerable Turing degrees is undecidable.citation
author = Harrington, L.; Shelah, S.
year = 1982
title = The undecidability of the recursively enumerable degrees
journal = Bull. Amer. Math. Soc.(NS)
volume = 6
issue = 1
pages = 79–80
doi = 10.1090/S0273-0979-1982-14970-9
url = http://www.projecteuclid.org/handle/euclid.bams/1183548593]

References

External links

* [http://math.berkeley.edu/~leo/ Home page] .
*MathGenealogy |id=22298