Herbert Enderton | Academic Influence

Herbert Enderton's AcademicInfluence.com Rankings

Herbert Enderton

Mathematics

#3327

World Rank

#4933

Historical Rank

#1243

USA Rank

Measure Theory

#1979

World Rank

#2405

Historical Rank

#591

USA Rank

mathematics Degrees

Download Badge

Mathematics

Herbert Enderton's Degrees

PhD Mathematics Princeton University
Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Herbert Enderton Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Herbert Bruce Enderton 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.

(See a Problem?)

Herbert Enderton's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A mathematical introduction to logic (1972) (2330)
THE JOURNAL OF SYMBOLIC LOGIC (2000) (402)
Elements of Set Theory (1977) (220)
Finite Partially-Ordered Quantifiers (1970) (140)
Elements of Recursion Theory (1977) (61)
Alonzo Church and the Reviews (1998) (56)
A note on the hyperarithmetical hierarchy (1970) (32)
Computability Theory: An Introduction to Recursion Theory (2010) (21)
Hierarchies in recursive function theory (1964) (18)
Review: G. E. Hughes, M. J. Cresswell, An Introduction to Modal Logic (1972) (17)
General Recursive Functions (2011) (13)
A mathematical introduction to logic / Herbert B. Enderton (1972) (11)
Degrees of Computational Complexity (1972) (9)
Approximating the standard model of analysis (1971) (7)
Hierarchies over recursive well-orderings (1964) (5)
In Memoriam: Alonzo Church 1903–1995 (1995) (4)
Computability & Unsolvability.Hilbert's Tenth Problem is Unsolvable (1987) (3)
On provable recursive functions (1968) (3)
Chapter TWO – First-Order Logic (2001) (3)
An infinitistic rule of proof (1968) (3)
On Complete Sets of Logic Primitives. (1970) (3)
Review: Martin D. Davis, Ron Sigal, Elaine J. Weyuker, Computability, Complexity, and Languages. Fundamentals of Theoretical Computer Science (1996) (2)
The unique existential quantifier (1970) (2)
Review: A. Mostowski, A Class of Models for Second Order Arithmetic; A. Mostowski, Formal System of Analysis Based on an Infinitistic Rule of Proof (1969) (1)
Review: Martin Davis, Hilary Putnam, Diophantine Sets Over Polynomial Rings (1972) (1)
Hodges Wilfrid. Elementary predicate logic. Handbook of philosophical logic, Volume I, Elements of classical logic , edited by Gabbay D. and Guenthner F., Synthese library, vol. 164, D. Reidel Publishing Company, Dordrecht, Boston, and Lancaster, 1983, pp. 1–131. (1989) (1)
Uspensky Vladimir A.. Godel's incompleteness theorem. A reprint of LV 889 with minor corrections. Theoretical computer science, vol. 130 (1994), pp. 239–319. (1995) (1)
Meeting of the Association for Symbolic Logic (1984) (0)
Chapter THREE – Undecidability (2001) (0)
Review: E. Shamir, On Sequential Languages and two classes of regular events. Introduction (1972) (0)
George F. H.. Automation cybernetics and society. Leonard Hill [Books] Ltd., London 1959, 283 pp. (1971) (0)
Andreas Blass. Near coherence of filters, 1: cofinal equivalence of models of arithmetic. Notre Dame journal of formal logic , vol. 27 (1986), pp. 579–591. (1993) (0)
Review: Patrick Suppes, Introduction to Logic (1999) (0)
CHAPTER 2 – AXIOMS AND OPERATIONS (1977) (0)
CHAPTER 8 – ORDINALS AND ORDER TYPES (1977) (0)
Review: Anita Burdman Feferman, From Trotsky to Godel. The Life of Jean van Heijenoort (2002) (0)
Review: Albert A. Mullin, On a Necessary Condition for the Validity of Goldbach's Conjecture (1971) (0)
4 – Recursive Enumerability (2011) (0)
Then 5 Conclusion Deenition 5.1 (positive Borel Point-set) Lemma 4.2 Let M Be a Model of the Signature 0 = Hh; <i Such That M 6 J (1995) (0)
CHAPTER 5 – CONSTRUCTION OF THE REAL NUMBERS1 (1977) (0)
Review: Vladimir A. Uspensky, Godel's incompleteness theorem (1995) (0)
Davis Martin. Extensions and corollaries of recent work on Hilbert's tenth problem. Illinois journal of mathematics, vol. 7 (1963), pp. 246–250. (1972) (0)
CHAPTER 9 – SPECIAL TOPICS (1977) (0)
Review: Chen Chuan Chong, An Application of Electric Circuits in Mathematical Logic (1970) (0)
Review: Martin Davis, Solvability, Provability, Definability: The Collected Works of Emil L. Post (1997) (0)
Review: H. C. Torng, Introduction to the Logical Design of Switching Systems; Basil Zacharov, Digital Systems Logic and Circuits; Ray Ryan, Basic Digital Electronics--Understanding Number Systems, Boolean Algebra, & Logic Circuits (1976) (0)
Review: Richard H. Popkin, The Columbia History of Western Philosophy (1999) (0)
CHAPTER 3 – RELATIONS AND FUNCTIONS (1977) (0)
Review: Sheldon B. Akers, On the Algebraic Manipulation of Majority Logic (1971) (0)
Chapter ONE – Sentential Logic (2001) (0)
Review: Julia Robinson, Diophantine Decision Problems (1972) (0)
Richard L. Epstein. Classical mathematical logic. The semantic foundations of logic. With contributions by Lesław W. Szczerba. Princeton University Press, Princeton and Oxford, 2006, xxii + 522 pp. (2007) (0)
Davis Martin and Putnam Hilary. Diophantine sets over polynomial rings. Illinois journal of mathematics , vol. 7 (1963), pp. 251–256. (1972) (0)
Review: Dennis Sentilles, A Bridge to Advanced Mathematics (1976) (0)
Fischer Patrick C.. Theory of provable recursive functions. Transactions of the American Mathematical Society , vol. 117 (1965), pp. 494–520. (1967) (0)
Kleene Stephen Cole. Introduction to metamathematics . Sixth printing of XIX 215. Wolters-Noordhoff Publishing, Groningen, North-Holland Publishing Company, Amsterdam and London, and American Elsevier Publishing Company, Inc., New York, 1971, X + 550 pp. (1973) (0)
Association for Symbolic Logic (1991) (0)
Poss Richard L.. A note on a lemma of J. W. Addison. Notre Dame journal of formal logic, vol. 11 (1970), pp. 337–339. (1973) (0)
Robinson Julia. Diophantine decision problems. Studies in number theory, edited by LeVeque W. J., Studies in mathematics, vol. 6, The Mathematical Association of America, Washington, D.C., distributed by Prentice-Hall, Inc., Englewood Cuffs, New Jersey, 1969, pp. 76–116. (1972) (0)
Review: F. H. George, Automation Cybernetics and Society (1971) (0)
Review: Morton L. Schagrin, The Language of Logic. A Programed Text (1974) (0)
Review: Andreas Blass, Near Coherence of Filters, I: Cofinal Equivalence of Models of Arithmetic (1993) (0)
JSL volume 49 issue 4 Cover and Back matter and Errata (1984) (0)
Review: Martin Davis, Extensions and Corollaries of Recent Work on Hilbert's Tenth Problem (1972) (0)
Review: Stephen Cole Kleene, Introduction to Metamathematics (1973) (0)
CHAPTER 6 – CARDINAL NUMBERS AND THE AXIOM OF CHOICE (1977) (0)
Schagrin Morton L.. The language of logic. A programed text . Random House, New York 1968, vii + 247 pp. (1974) (0)
Zakrevskii A. D.. A visual-matrix method for minimizing Boolean functions. English translation of XXXVI 572. Automation and remote control , vol. 21 (1960), pp. 255–258. (1971) (0)
Association for Symbolic Logic (1996) (0)
Review: Ken Hirose, A Conjecture on Hilbert's 10th Problem (1972) (0)
JSL volume 62 issue 4 Cover and Back matter and Errata (1997) (0)
Review: H. H. Loomis, R. H. Wyman, On Complete Sets of Logic Primitives (1970) (0)
Review: A. Ehrenfeucht, Separable Theories (1969) (0)
Connections to Logic (2011) (0)
Review: Martin Davis, One Equation to Rule Them all (1972) (0)
Review: Albert A. Mullin, On a Theorem Equivalent to Post's Fundamental Theorem of Recursive Function Theory (1971) (0)
Chapter ZERO – Useful Facts about Sets (2001) (0)
Association for Symbolic Logic (1993) (0)
Cutland Nigel. Computabitity. An introduction to recursive function theory. Cambridge University Press, Cambridge etc. 1980, x + 251 pp. (1987) (0)
Suppes Patrick, Introduction to logic. A republication of XXII 353 Publications, Mineola, New York, 1999, xiv + 312 pp. (1999) (0)
Review: Manuel Blum, On the Size of Machines (1972) (0)
Rosser J. Barkley. Logic for mathematicians . Second edition of XVIII 326. Chelsea Publishing Company, New York 1978, xv + 574 pp. (1980) (0)
Mullin Albert A.. On a necessary condition for the validity of Goldbach's conjecture. Zeitschrift für mathematische Logik und Grundlagen der Mathematik , vol. 9 (1963), pp. 145–148. (1971) (0)
Akers Sheldon B. Jr., On the algebraic manipulation of majority logic. IRE transactions on electronic computers , vol. EC-10 (1961), p. 779. (1971) (0)
Review: Richard L. Poss, A Note on a Lemma of J. W. Addison (1973) (0)
Parker F. D.. Boolean matrices and logic. Mathematics magazine , vol. 37 (1964), pp. 33–38. Campbell Hugh G.. Linear algebra with applications including linear programming . Appleton-Century-Crofts, Educational Division, Meredith Corporation, New York 1971, xiii + 396 + A45 pp. (1975) (0)
REVIEWS-Classical mathematical logic (2007) (0)
LOGICAL DESIGN FOR FAST SERIAL COMPUTER (1965) (0)
Review: K. Kuratowski, A. Mostowski, M. Maczynski, Set Theory (1975) (0)
JSL volume 46 issue 4 Cover and Back matter and Errata (1981) (0)
Polynomial-Time Computability (2011) (0)
Shaligram Singh. The independence of a strong axiom of choice. The mathematical gazette , vol. 46 (1962), pp. 126–129. (1973) (0)
CHAPTER 7 – ORDERINGS AND ORDINALS (1977) (0)
Chen Chuan Chong. An application of electric circuits in mathematical logic. Majallah Tahunan ‘Ilmu Pasti—Shu Hsiieh Nien K'an—Bulletin of Mathematical Society of Nanyang University (1963), pp. 119–126. (1970) (0)
Devlin Keith. The joy of sets. Fundamentals of contemporary set theory . Second edition of XLVI419. Undergraduate texts in mathematics. Springer-Verlag, New York, Berlin, Heidelberg, etc., 1993, x + 192 pp. (1994) (0)
Review: Shaligram Singh, Independence of a Strong Axiom of Choice (1973) (0)
JSL volume 50 issue 4 Cover and Back matter and Errata (1985) (0)
Looms H. H. Jr., and Wyman R. H. Jr., On complete sets of logic primitives. IEEE transactions on electronic computers, vol. EC-14 (1965), pp. 173–174. (1970) (0)
Review: N. V. Belakin, Computation of Effective Operators on Turing Machines with Restricted Erasure (1972) (0)
Cumulative index to volumes 27–55 (1962–1990) (1990) (0)
Review: Patrick C. Fischer, Theory of Provable Recursive Functions (1967) (0)
Levi Isaac. Gambling with truth. An essay on induction and the aims of science . Paperback edition of XXXVI 318. The MIT Press, Cambridge, Massachusetts, and London, 1973, xiv + 246 + v pp. (1976) (0)
Programs and Machines (2011) (0)
Review: E. G. K. Lopez-Escobar, A Non-Interpolation Theorem (1975) (0)
Chapter FOUR – Second-Order Logic (2001) (0)
Degrees of Unsolvability (2011) (0)
Review: L. A. Harrington, M. D. Morley, A. Scedrov, S. G. Simpson, Introduction (1990) (0)
CHAPTER 4 – NATURAL NUMBERS (1977) (0)
Review: J. Barkley Rosser, Logic for Mathematicians (1980) (0)
Sentilles Dennis. A bridge to advanced mathematics. The Williams & Wilkins Company, Baltimore 1975, xiii + 387 pp. (1976) (0)
Review: A. D. Zakrevskii, A Visual-Matrix Method for Minimizing Boolean Functions (1971) (0)
Constructible β‐models (1973) (0)
The Computability Concept (2011) (0)
JSL volume 47 issue 4 Cover and Back matter and errata (1982) (0)

This paper list is powered by the following services:

Other Resources About Herbert Enderton

en.wikipedia.org

What Schools Are Affiliated With Herbert Enderton?

Herbert Enderton is affiliated with the following schools: