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.
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 |
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
editHe lived in Santa Monica. He married his wife, Cathy, in 1961 and they had two sons; Eric and Bert.[4]
Death
editSelected publications
edit- 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
edit- ^ a b "Deaths of AMS Members" (PDF). Notices of the American Mathematical Society. 58 (1). AMS. 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.
- ^ a b "Obituary". Los Angeles Times. October 31, 2010. Retrieved February 9, 2011.