Logic for computer science: foundations of automatic theorem proving

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

"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.

Author(s): Jean H. Gallier
Series: Harper & Row computer science and technology series
Publisher: Longman Higher Education
Year: 1986

Language: English
Commentary: free web version
Pages: 534