Mathematical Logic [Ebbinghaus] - Printable Version +- MKLab (https://mklab.gr) +-- Forum: [INDEX] (https://mklab.gr/forumdisplay.php?fid=1) +--- Forum: MATHEMATICS (https://mklab.gr/forumdisplay.php?fid=3) +---- Forum: BOOKS (https://mklab.gr/forumdisplay.php?fid=6) +----- Forum: NEW BOOKS (https://mklab.gr/forumdisplay.php?fid=42) +------ Forum: FOREIGN (https://mklab.gr/forumdisplay.php?fid=91) +------- Forum: PURE AND APPLIED MATHS (https://mklab.gr/forumdisplay.php?fid=94) +-------- Forum: FOUNDATIONS OF MATHS (https://mklab.gr/forumdisplay.php?fid=168) +-------- Thread: Mathematical Logic [Ebbinghaus] (/showthread.php?tid=1846)

Mathematical Logic [Ebbinghaus] - mklabgr - 09-04-2026 Mathematical Logic Authors: H.-D. Ebbinghaus, J. Flum, W. Thomas Publication date: 1994, 2nd edition Publisher: Springer New York Summary Mathematical Logic is a systematic introduction to the foundations of modern mathematical logic, centered primarily on first-order logic. It begins by formalizing mathematical languages, distinguishing syntax from semantics, and developing a rigorous proof calculus. One of its central results is Gödel's Completeness Theorem, which establishes the fundamental equivalence between semantic consequence and formal provability: roughly, if a statement logically follows from a set of axioms, there is a formal proof of it within an appropriate deductive system.  The book then moves from basic proof theory toward model theory, covering the Löwenheim–Skolem theorem, the Compactness Theorem, normal forms, and the expressive limitations of first-order languages. A major theme is the distinction between what a formal language can express and what a formal deductive system can prove. This leads naturally to the limitations of formal mathematics, including ideas related to Gödel's incompleteness phenomena and the relationship between logic, arithmetic, and set theory.  The later chapters broaden the scope considerably, discussing extensions of first-order logic, free models and logic programming, elementary equivalence, and Lindström's theorems, which characterize first-order logic in terms of properties such as compactness. Consequently, the book serves not merely as an elementary logic textbook but as a bridge toward model theory, computability, theoretical computer science, and the foundations of mathematics.  Key takeaways First-order logic is the central framework: the book develops its syntax, semantics, proof systems, and model-theoretic properties from the ground up.  Gödel's Completeness Theorem explains why formal proof systems for first-order logic can capture every semantically valid consequence. Compactness and Löwenheim–Skolem reveal surprisingly powerful—and sometimes counterintuitive—properties of first-order theories.  The later sections emphasize the limits of formalization and connect mathematical logic with set theory, logic programming, algebra, and theoretical computer science. BOOK