**Logic for Computer Science**

by Jean H. Gallier

**Publisher**: Longman Higher Education 1986**ISBN/ASIN**: 0060422254**ISBN-13**: 9780060422257**Number of pages**: 528

**Description**:

This book is intended as an introduction to mathematical logic, with an emphasis on proof theory and procedures for constructing formal proofs of formulae algorithmically. Since the main emphasis of the text is on the study of proof systems and algorithmic methods for constructing proofs, it contains some features rarely found in other texts on logic. This book is designed primarily for computer scientists, and more generally, for mathematically inclined readers interested in the formalization of proofs, and the foundations of automatic theorem-proving.

Download or read it online for free here:

**Download link**

(multiple PDF, PS files)

## Similar books

**Proof, Sets, and Logic**

by

**M. Randall Holmes**-

**Boise State University**

This textbook is intended to communicate something about proof, sets, and logic. It is about the foundations of mathematics, a subject which results when mathematicians examine the subject matter and the practice of their own subject very carefully.

(

**8857**views)

**Isabelle/HOL: A Proof Assistant for Higher-Order Logic**

by

**T. Nipkow, L.C. Paulson, M. Wenzel**-

**Springer**

This book is a self-contained introduction to interactive proof in higher-order logic, using the proof assistant Isabelle. It is a tutorial for potential users. The book has three parts: Elementary Techniques; Logic and Sets; Advanced Material.

(

**6263**views)

**Language, Proof and Logic**

by

**Jon Barwise, John Etchemendy**-

**Center for the Study of Language**

The book covers the boolean connectives, formal proof techniques, quantifiers, basic set theory, induction, proofs of soundness and completeness for propositional and predicate logic, and an accessible sketch of Godel's first incompleteness theorem.

(

**10561**views)

**Proofs and Types**

by

**J. Girard, Y. Lafont, P. Taylor**-

**Cambridge University Press**

This little book comes from a short graduate course on typed lambda-calculus given at the Universite Paris. It is not intended to be encyclopedic and the selection of topics was really quite haphazard. Some very basic knowledge of logic is needed.

(

**8511**views)