Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
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.
Peter Aczel, Harold Simmons, Stanley S. Wainer, Peter (University of Manchester) Aczel, Harold (University of Manchester) Simmons, Stanley S. (University of Leeds) Wainer
S. B. Cooper, T. A. Slaman, S. S. Wainer, S. B. (University of Leeds) Cooper, T. A. (University of Chicago) Slaman, S. S. (University of Leeds) Wainer, Stanley S. Wainer