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.
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.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Shop der buecher.de GmbH & Co. KG Bürgermeister-Wegele-Str. 12, 86167 Augsburg Amtsgericht Augsburg HRA 13309
