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

By Jean H. Gallier

Book Overview

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.

• Format: Paperback
• Language: English
• ISBN: 0486780821
• ISBN13: 9780486780825
• Release Date: June 2015
• Publisher: Dover Publications
• Length: 528 Pages
• Weight: 1.72 lbs.
• Dimensions: 1.0" x 6.1" x 9.1"

Customer Reviews

Very well written

One of the better books written on automated theorem proving.The author gives a very clear and lucid treatment of areas suchas propositional and first-order logic, resolution, proof theory(including Gentzen's cut-elimination theorem), logic programming, and typed logic. This book represents an ideal place to begin for anyone who is interested in developing a deep understanding of the foundations of automated reasoning. Careful detail is given towards Gentzen's tableaux methods for obtaining structural proofs, and the other takes great pains to provide rigorous proofs of the results.

i luv it!

this book is excellent and reading it one can clearly see galliers geometric insight influenced by the great french mathematicians cartan and serre! -kurt reillag