"Logic for Computer Science" provides an introduction to mathematical logic, with emphasis on proof theory and procedures for constructing formal proofs of formulae algorithmically. It is designed primarily for students, computer scientists, and, more generally, for mathematically inclined readers interested in the formalization of proofs and the foundations of automatic theorem proving. Since the main emphasis of the text is on the study of proof systems and algorithmic methods for constructing proofs, it contains features rarely found in other texts on logic. Four of these are: the use of Gentzen systems; a justification of the resolution method via a translation from a Gentzen system; a presentation of SLD-resolution and a presentation of the foundations of PROLOG; fast decisions procedures based on congruence closures.

Скачать книгу бесплатно (pdf, 1.85 Mb)

---

Читать «Logic for computer science: foundations of automatic theorem proving»