Peter Aczel / Harold Simmons / Stanley Wainer (eds.)

Proof Theory

A Selection of Papers from the Leeds Proof Theory Programme 1990
Herausgeber: Aczel, Peter; Wainer, Stanley S.; Simmons, Harold

• Gebundenes Buch

Produktbeschreibung

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 W. Buchholz; 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 D. Howe; 9. Fragments of Kripke-Platek set theory M. Rathjen; 10. Provable computable selection functions on abstract structures J. Tuckers and J. Zucker.

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

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

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Seitenzahl: 320
• Erscheinungstermin: 17. November 2004
• Englisch
• Abmessung: 235mm x 157mm x 23mm
• Gewicht: 672g
• ISBN-13: 9780521414135
• ISBN-10: 052141413X
• Artikelnr.: 21152424

Inhaltsangabe

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.