Description

Book Synopsis

A collection of expository and research articles derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory.

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.

Proof Theory

    Product form

    A Hardback by Peter Aczel, Harold Simmons, Stanley S. Wainer

    £110.00

    Includes FREE delivery

    Order before 4pm on Monday for delivery by Wed 2 Dec 2026.

    15 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Proof Theory by Peter Aczel

      Book details

      Publisher Cambridge University Press
      Published 11 February 1993
      ISBN-13 9780521414135
      978-0521414135
      ISBN-10 052141413X
      Also in:
      Mathematical theory of computation Mathematical logic

      Description

      Book Synopsis

      A collection of expository and research articles derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory.

      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.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account