Book contents
- Frontmatter
- Contents
- Preface
- Programme of lectures
- Basic proof theory
- A short course in ordinal analysis
- Proofs as Programs
- A simplified version of local predicativity
- A note on bootstrapping intuitionistic bounded arithmetic
- Termination orderings and complexity characterisations
- Logics for termination and correctness of functional programs, II. Logics of strength PRA
- Reflecting the semantics of reflected proof
- Fragments of Kripke-Platek set theory with infinity
- Provable computable selection functions on abstract structures
Frontmatter
Published online by Cambridge University Press: 05 November 2011
- Frontmatter
- Contents
- Preface
- Programme of lectures
- Basic proof theory
- A short course in ordinal analysis
- Proofs as Programs
- A simplified version of local predicativity
- A note on bootstrapping intuitionistic bounded arithmetic
- Termination orderings and complexity characterisations
- Logics for termination and correctness of functional programs, II. Logics of strength PRA
- Reflecting the semantics of reflected proof
- Fragments of Kripke-Platek set theory with infinity
- Provable computable selection functions on abstract structures
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9780511896262/resource/name/firstPage-9780511896262pre_pi-iv_CBO.jpg)
- Type
- Chapter
- Information
- Proof TheoryA selection of papers from the Leeds Proof Theory Programme 1990, pp. i - ivPublisher: Cambridge University PressPrint publication year: 1993