Leo Harrington
From Wikipedia, the free encyclopedia
| Leo A. Harrington | |
|---|---|
 |
|
| Born | May 17, 1946 |
| Citizenship |  United States |
| Fields | Mathematics |
| Institutions | University of California, Berkeley |
| Alma mater | MIT |
| Doctoral advisor | Gerald E. Sacks |
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.[1]
- Harrington showed that if the Axiom of Determinacy holds for all analytic sets then x# exists for all reals x.[2]
- Harrington and Saharon Shelah showed that the first order theory of the partially ordered set of recursively enumerable Turing degrees is undecidable.[3]
[edit] References
- ^ Paris, J.; Harrington, L. (1977), "A Mathematical Incompleteness in Peano Arithmetic", in Barwise, J., Handbook of Mathematical Logic, North-Holland, pp. 1133–1142
- ^ Harrington, L. (1978), "Analytic Determinacy and 0#", Journal of Symbolic Logic (The Journal of Symbolic Logic, Vol. 43, No. 4) 43 (4): 685–693, doi:10.2307/2273508, JSTOR 2273508
- ^ Harrington, L.; Shelah, S. (1982), "The undecidability of the recursively enumerable degrees", Bull. Amer. Math. Soc.(NS) 6 (1): 79–80, doi:10.1090/S0273-0979-1982-14970-9, http://www.projecteuclid.org/handle/euclid.bams/1183548593
[edit] External links
   |
This article about an American mathematician is a stub. You can help Wikipedia by expanding it. |
