*Logic for Computer Science: Foundations of Automatic Theorem Proving, by Jean Gallier*, covers the mathematical logic necessary to computer science, emphasizing algorithmic methods for solving proofs.

**Description**

Treatment is self-contained, with all required mathematics contained in Chapter 2 and the appendix. Provides readable, inductive definitions and offers a unified framework using Getzen systems. Offers unique coverage of congruence, and contains an entire chapter devoted to SLD resolution and logic programming (PROLOG). Includes applications to artificial intelligence. Each chapter contains worked examples, programming assignments, problems graded according to difficulty, and historical remarks and suggestions for further reading.

**Table of Contents**

- Introduction
- Mathematical Preliminaries
- Propositional Logic
- Resolution in Propositional Logic
- First-Order Logic
- Gentzen’s Cut Elimination Theorem and Applications
- Gentzen’s Sharpened Hauptsatz; Herbrand’s Theorem
- Resolution in First-Order Logic
- Sld-Resolution and Logic Programming (Prolog)
- Many-Sorted First-Order Logic

**Book Details**

Publisher: John Wiley and Sons

Format(s): PDF

File size: 6.99 MB

Number of pages: 534

Link: Logic for Computer Science [PDF]