Proof Theory
A selection of papers from the Leeds Proof Theory Programme 1990
- Publisher's listprice GBP 114.00
-
57 695 Ft (54 948 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. 11 539 Ft off)
- Discounted price 46 156 Ft (43 958 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
57 695 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:
- Publisher Cambridge University Press
- Date of Publication 11 February 1993
- ISBN 9780521414135
- Binding Hardback
- No. of pages320 pages
- Size 229x152x22 mm
- Weight 640 g
- Language English 0
Categories
Short description:
A collection of expository and research articles derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory.
MoreLong description:
The lecture courses in this work are derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory held at Leeds University. The contributions come from acknowledged experts and comprise expository and research articles; put together in this book they form an invaluable introduction to proof theory that is aimed at both mathematicians and computer scientists.
MoreTable of Contents:
Preface; Programme of lectures; 1. Basic proof theory S. Wainer and L. Wallen; 2. A short course in ordinal analysis W. Pohlers; 3. Proofs as programs H. Schwichtenberg; 4. A simplified version of local predicativity W. Buchholz; 5. A note on bootstrapping intuitionistic bounded arithmetic S. Buss; 6. Termination orderings and complexity characterisations E. Cichon; 7. Logics for termination and correctness of functional programs, II. Logics of strength PRA S. Feferman; 8. Reflecting the semantics of reflected proof D. Howe; 9. Fragments of Kripke-Platek set theory with infinity M. Rathjen; 10. Provable computable selection functions on abstract structures J. Tucker and J. Zucker.
More
