This junior/senior level text starts with a thorough treatment of first-order logic and its role in the foundations of mathematics. It covers several advanced topics, not commonly treated in introductory texts, such as Trachtenbrot's undecidability theorem, Fraïssé's characterization of elementary equivalence, Lindström's theorem on the maximality of first-order logic, and the fundamentals of logic programming.

Autorentext
Prof. Dr. Heinz-Dieter Ebbinghaus und Prof. Dr. Jörg Flum forschen am Mathematischen Institut der Universität Freiburg, Prof. Dr. Wolfgang Thomas am Lehrstuhl für Informatik 7 (Logik und Theorie diskreter Systeme) der RWTH Aachen.

Zusammenfassung
Our first goal is Godel's completeness theorem, which shows that the con­ sequence relation coincides with formal provability: By means of a calcu­ lus consisting of simple formal inference rules, one can obtain all conse­ quences of a given axiom system (and in particular, imitate all mathemat­ ical proofs).

Inhalt
A.- I Introduction.- II Syntax of First-Order Languages.- III Semantics of First-Order Languages.- IV A Sequent Calculus.- V The Completeness Theorem.- VI The Löwenheim-Skolem and the Compactness Theorem.- VII The Scope of First-Order Logic.- VIII Syntactic Interpretations and Normal Forms.- B.- IX Extensions of First-Order Logic.- X Limitations of the Formal Method.- XI Free Models and Logic Programming.- XII An Algebraic Characterization of Elementary Equivalence.- XIII Lindström's Theorems.- References.- Symbol Index.