Herbert B. Enderton | |
|---|---|
| Born | Herbert Bruce Enderton April 15, 1936 |
| Died | October 20, 2010 (aged 74) Santa Monica, California, U.S. |
| Nationality | American |
| Alma mater | Harvard University |
| Scientific career | |
| Fields | Mathematical Logic |
| Institutions | UCLA |
Herbert Bruce Enderton (April 15, 1936 – October 20, 2010)[1] was an American mathematician. He was a Professor Emeritus of Mathematics at UCLA and a former member of the faculties of Mathematics and of Logic and the Methodology of Science at the University of California, Berkeley.
Enderton also contributed to recursion theory, the theory of definability, models of analysis, computational complexity, and the history of logic.[2]
He earned his Ph.D. at Harvard in 1962.[3] He was a member of the American Mathematical Society from 1961 until his death.[1]
Personal life
He lived in Santa Monica. He married his wife, Cathy, in 1961 and they had two sons; Eric and Bert.[4]
Later years
From 1980 to 2002 he was coordinating editor of the reviews section of the Association for Symbolic Logic's Journal of Symbolic Logic.[5]
Death
Selected publications
- Elements of Set Theory. Academic Press. 1977. ISBN 978-0-12-238440-0.
- A Mathematical Introduction to Logic. Academic Press. 1972. ISBN 978-0-12-238452-3.
- Computability Theory: An Introduction to Recursion Theory. Academic Press. 2011. ISBN 978-0-12-384958-8.
References
- 1 2 "Deaths of AMS Members" (PDF). Notices of the American Mathematical Society. AMS. 58 (1). January 2011.
- ↑ Richard Zach (October 28, 2010). "Herbert B. Enderton, 1936-2010". University of Calgary. Retrieved February 9, 2011.
- ↑ "UCLA Department of Mathematics". UCLA. Retrieved February 9, 2011.
- 1 2 "Obituary". Los Angeles Times. October 31, 2010. Retrieved February 9, 2011.
- ↑ "Journals - Reviews". Association for Symbolic Logic. Retrieved February 9, 2011.