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

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

Peter Aczel (Edited by), Harold Simmons (Edited by), Stanley S. Wainer (Edited by)

9780521054164, Cambridge University Press

Paperback / softback, published 21 January 2008

320 pages
22.8 x 15.1 x 1.8 cm, 0.484 kg

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.

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.

Subject Areas: Mathematical theory of computation [UYA], Mathematical logic [PBCD]