• Title: Logic for Computer Science: Foundations of Automatic Theorem Proving
• Author(s) Jean H. Gallier
• Publisher: Dover Publications; (June 18, 2015); eBook (Second Edition)
• Hardcover/Paperback: 528 pages
• eBook: PDF and PostScript Files
• Language: English
• ISBN-10: 0486780821
• ISBN-13: 978-0486780825
• Share This:  

Book Description

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.

• Jean H. Gallier is a researcher in computational logic at the University of Pennsylvania, where he holds appointments in the Computer and Information Science Department and the Department of Mathematics.

• Amazon
• Amazon (1986 Edition)

• Mathematical Logic - Set Theory, Model Theory, Computability, etc
• Artificial Intelligence, Machine Learning, and Logic Programming
• Prolog Programming
• Discrete and Finite Mathematics
• Introduction to Computer Science

• Logic for Computer Science: Foundations of Automatic Theorem Proving (Jean H. Gallier)
• The Mirror Site (1) - PDF
• Mathematical Logic For Computer Science (Mordechai Ben-Ari)

• Discrete Structures, Logic, and Computability (James L. Hein)

  This book introduces beginning computer science and computer engineering students to the fundamental techniques and ideas used by computer scientists today, focusing on topics from the fields of mathematics, logic, and computer science itself.

• The Haskell Road to Logic, Maths and Programming (Kees Doets)

  The purpose of this book is to teach logic and mathematical reasoning in practice, and to connect logical reasoning with computer programming. Haskell is based on a logical theory of computable functions called the lambda calculus.

• Prolog Experiments in Discrete Math, Logic, and Computability

  This book contains programming experiments that are designed to reinforce the learning of discrete mathematics, logic, and computability. The Prolog programming language is the tool used for the experiments in this book.

• Computability Theory: Introduction to Recursion Theory

  Computability Theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. These texts provide concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results.

• Computability, Unsolvability, Randomness (Stephen G. Simpson)

  The author exposits Turing's 1936 theory of computability and unsolvability, as subsequently developed by Kleene and Post. This theory is of the essence in theoretical computer science and in the study of unsolvable mathematical problems.

• Computability and Randomness (Andre Nies)

  The complexity and the randomness aspect of a set of natural numbers are closely related. This book includes a detailed treatment of Turing's theory of computability and unsolvability as subsequently developed by Kleene, Post, Friedberg, etc.

• Incompleteness and Computability: Gödel's Theorems

  This book is an introduction to metamathematics and Gödel's Theorems. It covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.

• A Friendly Introduction to Mathematical Logic (Chris Leary)

  In this user-friendly book, readers with no previous study in the field are introduced to the basics of model theory, proof theory, and computability theory, leading to rigorous proofs of Gödel's First and Second Incompleteness Theorems.