- Home
- Mathematics
- Logic
- Logic for Computer Science (Foundations of Automatic Theorem Proving, Second Edition)
Logic for Computer Science (Foundations of Automatic Theorem Proving, Second Edition)
List Price:
$32.95
- Availability: Confirm prior to ordering
- Branding: minimum 50 pieces (add’l costs below)
- Check Freight Rates (branded products only)
Branding Options (v), Availability & Lead Times
- 1-Color Imprint: $2.00 ea.
- Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
- Belly-Band Wrap: $2.50 ea. (full-color printed)
- Set-Up Charge: $45 per decoration
- Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
- Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
- Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
- RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
Product Details
Author:
Jean H. Gallier
Format:
Paperback
Pages:
528
Publisher:
Dover Publications (June 18, 2015)
Language:
English
ISBN-13:
9780486780825
ISBN-10:
0486780821
Weight:
26.72oz
Dimensions:
6.1875" x 9.25"
Case Pack:
16
Series:
Dover Books on Computer Science
File:
Dover-Dover_05022026_P10034514_onix30_Complete-20260501.xml
Folder:
Dover
As low as:
$31.30
List Price:
$32.95
Publisher Identifier:
P-DOVER
Discount Code:
D
Audience:
College/higher education
Pub Discount:
65
Imprint:
Dover Publications
Overview
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.
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.
