Metamathematics, Machines and Gödel's Proof
Series: Cambridge Tracts in Theoretical Computer Science; 38;
- Publisher's listprice GBP 45.00
-
22 774 Ft (21 690 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 4 555 Ft off)
- Discounted price 18 220 Ft (17 352 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
22 774 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number New ed
- Publisher Cambridge University Press
- Date of Publication 30 January 1997
- ISBN 9780521585330
- Binding Paperback
- No. of pages220 pages
- Size 248x175x17 mm
- Weight 413 g
- Language English
- Illustrations 4 b/w illus. 0
Categories
Short description:
Describes the use of computer programs to check several proofs in the foundations of mathematics.
MoreLong description:
Mathematicians from Leibniz to Hilbert have sought to mechanise the verification of mathematical proofs. Developments arising out of G&&&246;del's proof of his incompleteness theorem showed that no computer program could automatically prove true all the theorems of mathematics. In practice, however, there are a number of sophisticated automated reasoning programs that are quite effective at checking mathematical proofs. Now in paperback, this book describes the use of a computer program to check the proofs of several celebrated theorems in metamathematics including G&&&246;del's incompleteness theorem and the Church-Rosser theorem. The computer verification using the Boyer-Moore theorem prover yields precise and rigorous proofs of these difficult theorems. It also demonstrates the range and power of automated proof checking technology. The mechanisation of metamathematics itself has important implications for automated reasoning since metatheorems can be applied by labour-saving devices to simplify proof construction. The book should be accessible to scientists and philosophers with some knowledge of logic and computing.
MoreTable of Contents:
1. Introduction; 2. The statement of the incompleteness theorem; 3. Derived inference rules; 4. The representability of metatheory; 5. The undecidable sentence; 6. A mechanical proof of the Church-Rosser theorem; 7. Conclusions.
More
