Logic for computer science : Foundations of automatic theorem proving Jean H. Gallier, Department of Computer and Information Science, University of Pennsylvania

By:

Gallier, Jean H

Series: Dover books on computer sciencePublication details: Mineola, N. Y.: Dover Publications, c2015Edition: Second editionDescription: xxiii, 496 p. ; 24 cmISBN:

978-0-486-78082-5

Subject(s):

DDC classification:

511.3

Summary: "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. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in first-order logic; SLD-resolution, logic programming, and the foundations of PROLOG; and many-sorted first-order logic. Numerous problems appear throughout the book, and two Appendixes provide practical background information"--

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Copy number	Status	Date due	Barcode
Carti	IMAR	511.3-GAL (Browse shelf(Opens below))	1	Available		0036543

eng

"This Dover edition, first published in 2015, is an unabridged republication of the revised 2003 online edition of the work originally published by Harper & Row, New York, in 1986. A new Preface to the Dover Edition has been specially prepared for this volume."
Bibliografie p. 473
Index p. 479

"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. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in first-order logic; SLD-resolution, logic programming, and the foundations of PROLOG; and many-sorted first-order logic. Numerous problems appear throughout the book, and two Appendixes provide practical background information"--

There are no comments on this title.

to post a comment.