Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Item added to bagSorry, there was a problem getting your bag informationItem cannot be purchased with the existing contents of your bagItem unavailable online
✕

was added to your bag.

Please try again.

Sorry, this item cannot be purchased in the same transaction as the existing items in your bag.

Please complete the purchase of the items currently in your bag and then add this item in a separate transaction or visit Shopping Help.

Sorry, this product is not currently available to buy online. Please visit Shopping Help.

View bag and checkout
Remove item
✕

Are you sure you want to remove from your bag?

Recommended product

Popular links

Popular links

Proof Theory

All titles
Proof Theory

Proof Theory

A selection of papers from the Leeds Proof Theory Programme 1990
Peter Aczel , University of Manchester
Harold Simmons , University of Manchester
Stanley S. Wainer , University of Leeds
January 2008
Available
Paperback
9780521054164

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact [email protected] providing details of the course you are teaching.

$50.00
USD
Paperback
USD
Hardback
    Description

    This work is derived from the SERC "Logic for IT" Summer School Conference on Proof Theory held at Leeds University. The contributions come from acknowledged experts and comprise expository and research articles which form an invaluable introduction to proof theory aimed at both mathematicians and computer scientists.

    • Only selected articles are included
    • The opening papers form an excellent introduction to proof theory

    Product details

    April 1993
    Hardback
    9780521414135
    320 pages
    229 × 152 × 22 mm
    0.64kg
    Available

    Often bought together

    Metamathematics, Machines and Gödel's Proof
    Metamathematics, Machines and Gödel's Proof

    : Paperback

    Specification and Proof in Real Time CSP
    Specification and Proof in Real Time CSP

    : Hardback

    The Clausal Theory of Types
    The Clausal Theory of Types

    : Hardback

    Categories and Computer Science
    Categories and Computer Science

    : Hardback

    Often bought together

    This title is available for institutional purchase via Cambridge Core

    Learn more
    cambridge core banner

    Related Journals

    The Review of Symbolic Logic
    The Review of Symbolic Logic

    : Journal

    The Review of Symbolic Logic is designed to cultivate research on theborders of logic, philosophy, and the sciences, and to supportsubstantive interactions between these disciplines. The journalwelcomes submissions in any of the following areas, broadly construed: - The general study of logical systems and their semantics,including non-classical logics and algebraic logic; - Philosophical logic and formal epistemology, including interactions with decision theory and game theory; - The history, philosophy, and methodology of logic and mathematics, including the history of philosophy of logic and mathematics; - Applications of logic to the sciences, such as computer science, cognitive science, and linguistics; and logical results addressing foundational issues in the sciences. The Review welcomes submissions in all these areas. (For informationon how to submit papers, see Guidelines below.) The Review beganpublication in June 2008.

    Related Journals

    Also by this Author

    Contents

    Table 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.
      • Show more

    Look inside

    Courses
    Resources
    Additional Information
    About the authors
      Contributors

    • S. Wainer, L. Wallen, W. Pohlers, H. Schwichtenberg, W. Buchholz, S. Buss, E. Cichon, S. Feferman, D. Howe, M. Rathjen, J. Tuckers, J. Zucker

      • Editors
    • Peter Aczel , University of Manchester
    • Harold Simmons , University of Manchester
    • Stanley S. Wainer , University of Leeds
    Accessibility

    Browse by related subject

     
    ✕

    Sorry, this item cannot be purchased in the same transaction as the existing items in your cart.

    Please complete the purchase of the items currently in your cart and then add this item in a separate transaction or contact

    Customer Services