This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Logic, Part I | |
|---|---|
![]() | |
| Name | Logic, Part I |
| Paradigms | Classical logic, modal logic, intuitionistic logic |
| Notable figures | Aristotle, Gottlob Frege, Bertrand Russell, Kurt Gödel |
| First appeared | Ancient Greece |
Logic, Part I
Logic, Part I surveys formal Aristotle, Stoicism, Plato-era antecedents and modern developments through figures such as Gottlob Frege, Bertrand Russell, Kurt Gödel and institutions like University of Cambridge, University of Göttingen, Princeton University that shaped analytic traditions. It situates core notions — syntax, semantics, proof — alongside systems exemplified by Boolean algebra, Hilbert system, Gentzen, and bridges to applied contexts in Alan Turing-inspired computation, Claude Shannon-based information theory and John von Neumann-era foundations.
Logic traces roots to Aristotle's syllogistic and progressed through Stoicism and Medieval Scholasticism into modern symbolization by Gottlob Frege, George Boole, Augustus De Morgan and Charles Sanders Peirce. Subsequent developments by Bertrand Russell, Alfred North Whitehead, Kurt Gödel and Alonzo Church formalized syntax and semantics used at University of Oxford, University of Paris, Harvard University and Princeton University. Intersections with Alan Turing, Alonzo Church and John von Neumann tied logic to computing, while debates involving Ludwig Wittgenstein, G.E. Moore and W.V.O. Quine shaped analytic philosophy institutions like The Vienna Circle and journals such as Mind.
Classical beginnings center on Aristotle's Organon and syllogistic analyzed at Lyceum and later revisited by Porphyry and Boethius; medieval elaboration appeared in works by Thomas Aquinas, William of Ockham and Peter Abelard. Renaissance and Enlightenment thought engaged logic through figures such as Francis Bacon, René Descartes and Gottfried Wilhelm Leibniz, with mechanical reasoning anticipated by Leibniz's calculus ratiocinator. Nineteenth-century advances by George Boole, Augustus De Morgan, Charles Sanders Peirce and John Venn established algebraic and diagrammatic methods adopted in Cambridge and Yale curricula. Twentieth-century formalization emerged via Gottlob Frege's Begriffsschrift, Bertrand Russell's Principia Mathematica with Alfred North Whitehead, David Hilbert's program at University of Göttingen, and proof-theoretic breakthroughs by Gerhard Gentzen, culminating in incompleteness results by Kurt Gödel and computability limits shown by Alan Turing and Alonzo Church.
Fundamental notions include syntax developed by Gottlob Frege and Bertrand Russell, semantics influenced by Alfred Tarski and model theory advanced at University of California, Berkeley and Institute for Advanced Study. Key terms—well-formed formula, entailment, validity, satisfiability—are used in work by Emil Post, Alfred North Whitehead, Rudolf Carnap and Willard Van Orman Quine. Distinctions among deduction systems trace to David Hilbert's axiomatic method, Gerhard Gentzen's sequent calculus, and semantic perspectives in Saul Kripke's modal semantics used across Princeton University and Massachusetts Institute of Technology research.
Propositional logic, formalized by George Boole and axiomatized in systems by Emil Post and David Hilbert, treats connectives studied by Alfred Tarski and applied in Claude Shannon's switching theory at Bell Labs. Truth-functional analysis underlies circuit design in Bell Labs and IBM engineering, with normal forms, completeness and decidability explored by Emil Post, Alonzo Church and Stephen Kleene. Algorithmic procedures such as truth tables and resolution connect to automated reasoning projects at Stanford University and Carnegie Mellon University.
Predicate logic extends propositional calculus via quantifiers formalized by Gottlob Frege, advanced in Principia Mathematica by Bertrand Russell and refined by Alonzo Church, Kurt Gödel and Henkin. Model theory and completeness theorems were established by Kurt Gödel and Leon Henkin with significant contributions from Alfred Tarski and Abraham Robinson; undecidability and incompleteness appeared in results by Kurt Gödel and Emil Post. Developments influenced set theory work by Georg Cantor, Ernst Zermelo, Abraham Fraenkel, and institutions such as Institute for Advanced Study and University of Cambridge where foundations debates involving Bertrand Russell and Ludwig Wittgenstein occurred.
Major proof systems include Hilbert-style systems championed by David Hilbert, natural deduction formulated by Gerhard Gentzen and Jaśkowski, sequent calculus by Gerhard Gentzen, and tableau methods used in automated theorem proving at SRI International and AT&T Bell Labs. Meta-theorems—completeness, soundness, consistency, compactness—were proven by Kurt Gödel, Alfred Tarski, Evert Willem Beth and Leon Henkin; proof theory advanced by Gerhard Gentzen and later by Georg Kreisel at institutions like ETH Zurich and Princeton University. Computational complexity of proof search links to Stephen Cook's and Richard Karp's work on NP-completeness at University of Toronto and University of California, Berkeley.
Applications span computer science innovations by Alan Turing, John McCarthy, Edsger Dijkstra and Donald Knuth, formal verification efforts at Bell Labs and NASA, and linguistic formalisms influenced by Noam Chomsky and Zellig Harris. Philosophical implications engaged Ludwig Wittgenstein, G.E. Moore, Willard Van Orman Quine, Hilary Putnam and Saul Kripke in debates over logicism, realism, and pluralism at forums like The Vienna Circle and journals such as Philosophical Review. Interdisciplinary impact appears in economics via decision theory at Cowles Commission and cognitive science at MIT and Carnegie Mellon University.