Logic for Computer Science: Foundations of Automatic Theorem Proving, Second Edition

This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving.
Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in first-order logic
SLD-resolution, logic programming, and the foundations of PROLOG
and many-sorted first-order logic. Numerous problems appear throughout the book, and two Appendixes provide practical background information.