Logic for Computer Science: Foundations of Automatic Theorem Proving

• Category: Computer
• Author: Jean H. Gallier
• Pages: : 528 pages
• File type: PDF and PostScript files

Read and download free eBook intituled Logic for Computer Science: Foundations of Automatic Theorem Proving in format PDF and PostScript files – : 528 pages created by Jean H. Gallier.

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.

Covers the mathematical logic necessary to computer science, emphasizing algorithmic methods for solving proofs. 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.

Read and Download Links:

Logic for Computer Science: Foundations of Automatic Theorem Proving