Proof Theory - A Selection of Papers From the Leeds Proof Theory Programme 1990

List 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.

Summary

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

Product details

• Authors: Peter (University of Manchester) Simmons Aczel, Peter Simmons Aczel, Leeds Proof Theory Programme
• Assisted by: Peter Aczel (Editor), Aczel Peter (Editor), Harold Simmons (Editor), Simmons Harold (Editor), Stanley S. Wainer (Editor), Wainer Stanley S. (Editor)
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Hardback
• Released: 11.02.1993
• EAN: 9780521414135
• ISBN: 978-0-521-41413-5
• No. of pages: 320
• Subjects: Natural sciences, medicine, IT, technology > Mathematics > General, dictionaries; MATHEMATICS / History & Philosophy, MATHEMATICS / Logic, COMPUTERS / Machine Theory, Mathematical theory of computation, Mathematical foundations