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.
Table of Contents
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
5. A note on bootstrapping intuitionistic
bounded arithmetic S. Buss
6. Termination orderings and complexity
characteristics E. Cichon
7. Logics for termination and correction of
functional programs S. Feferman
8. Reflecting the semantics of reflected proof
9. Fragments of Kripke-Platek set theory M.
10. Provable computable selection functions on
abstract structures J. Tuckers and J. Zucker.