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]

He lived in Santa Monica. He married his wife, Cathy, in 1961 and they had two sons; Eric and Bert.^[4]

From 1980 to 2002 he was coordinating editor of the reviews section of the Association for Symbolic Logic's Journal of Symbolic Logic.^[5]

He died from leukemia in 2010.^[4]

• 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.