Skip to content
Register Sign in Wishlist
Look Inside Proof Theory

Proof Theory
A selection of papers from the Leeds Proof Theory Programme 1990

CAD$50.95 (C)

S. Wainer, L. Wallen, W. Pohlers, H. Schwichtenberg, W. Buchholz, S. Buss, E. Cichon, S. Feferman, D. Howe, M. Rathjen, J. Tuckers, J. Zucker
View all contributors
  • Date Published: January 2008
  • availability: Available
  • format: Paperback
  • isbn: 9780521054164

CAD$ 50.95 (C)

Add to cart Add to wishlist

Other available formats:

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 providing details of the course you are teaching.

Product filter button
About the Authors
  • 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
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: January 2008
    • format: Paperback
    • isbn: 9780521054164
    • length: 320 pages
    • dimensions: 228 x 151 x 18 mm
    • weight: 0.484kg
    • availability: Available
  • Table of Contents

    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.

  • Editors

    Peter Aczel, University of Manchester

    Harold Simmons, University of Manchester

    Stanley S. Wainer, University of Leeds


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

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.