Logic and Computation
Interactive Proof with Cambridge LCF
Series: Cambridge Tracts in Theoretical Computer Science; 2;
- Publisher's listprice GBP 52.00
-
26 317 Ft (25 064 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. 5 263 Ft off)
- Discounted price 21 054 Ft (20 051 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
26 317 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 26 July 1990
- ISBN 9780521395601
- Binding Paperback
- No. of pages320 pages
- Size 247x187x19 mm
- Weight 574 g
- Language English 0
Categories
Long description:
This book is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines the methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of program statements. Cambridge LCF is based on an earlier theorem-proving system, Edinburgh LCF, which introduced a design that gives the user flexibility to use and extend the system. A goal of this book is to explain the design, which has been adopted in several other systems. The book consists of two parts. Part I outlines the mathematical preliminaries, elementary logic and domain theory, and explains them at an intuitive level, giving reference to more advanced reading; Part II provides sufficient detail to serve as a reference manual for Cambridge LCF. It will also be a useful guide for implementors of other programs based on the LCF approach.
"This book is well-written: it is a good text for any reader who wants to become familiar with Cambridge LCF, or, in general, with machine assisted (formal) proof construction." Mathematical Reviews
Table of Contents:
Part I. Preliminaries: 1. Survey and history of LCF; 2. Formal proof in first order logic; 3. A logic of computable functions; 4. Structural induction; Part II. Cambridge LCF: 5. Syntactic operators for PPL; 6. Theory structure; 7. Axioms and interference rules; 8. Tactics and tacticals; 9. Rewriting and simplification; 10. Sample proofs; Bibliography; Index.
More
