Proof Theory
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.
- Only selected articles are included
- The opening papers form an excellent introduction to proof theory
Product details
February 2008Paperback
9780521054164
320 pages
228 × 151 × 18 mm
0.484kg
Available
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.