Logic for Computer Science: Foundations of Automatic Theorem Proving
11 ratings by Goodreads
Language: German
Published by Longman Higher Education, 1986
- Hardcover
- Used

Seller: book-link, Nufringen, BW, Germanybook-link
5-star seller
AbeBooks seller since September 13, 2024
Hardcover
Condition: Used - Fine
US$ 39.44
US$ 58.26 shipping
Ships from Germany to U.S.A.
Quantity: 1 available
Add to basketItem description from seller
528 Seiten; M25-07-O-16-VG Sprache: Deutsch Gewicht in Gramm: 3.
Seller Inventory # 35279
- Title
- Logic for Computer Science: Foundations of Automatic Theorem Proving
- Author
- Gallier, Jean:
- Publisher
- Longman Higher Education
- Publication year
- 1986
- Condition
- Sehr gut
- Binding
- hardcover
- Language
- German
- ISBN 10
- 0060422254
- ISBN 13
- 9780060422257
- Item weight
- 3 grams
- Seller catalogs
- Varia
"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 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.
"Synopsis" may belong to another edition of this title.
book-link
Nufringen, BW, Germany
5-star seller
AbeBooks seller since September 13, 2024
Shipping rates from Germany to U.S.A.
| Item | 10 to 12 business days | 8 to 10 business days |
|---|---|---|
| First item | US$ 58.26 | US$ 87.56 |
Payment methods
Check
Seller's business information
book-link
Germany