Home Philosophy Wolfram Pohlers—Life and Work
Chapter
Licensed
Unlicensed Requires Authentication

Wolfram Pohlers—Life and Work

  • Justus Diller
Become an author with De Gruyter Brill
Explore this Subject How to publish with us
Ways of Proof Theory
This chapter is in the book Ways of Proof Theory

Chapters in this book

  1. Frontmatter i
  2. Preface vi
  3. Contents vii
  4. Wolfram Pohlers—Life and Work 1
  5. The Proof Theory of Classical and Constructive Inductive Definitions. A Forty Year Saga, 1968 – 2008 7
  6. A New Approach to Predicative Set Theory 31
  7. Characterising Definable Search Problems in Bounded Arithmetic via Proof Notations 65
  8. On Topological Models of GLP 135
  9. Program Extraction via Typed Realisability for Induction and Coinduction 157
  10. Another Reduction of Classical IDν to Constructive IDiν 183
  11. Elementary Constructive Operational Set Theory 199
  12. Functional Interpretations of Classical Systems 241
  13. Towards a Formal Theory of Computability 257
  14. Σ11 Choice in a Theory of Sets and Classes 283
  15. An Extended Predicative Definition of the Mahlo Universe 315
  16. ITTMs with Feedback 341
  17. Logspace without Bounds 355
  18. Investigations of Subsystems of Second Order Arithmetic and Set Theory in Strength between Π11 -CA and Δ12 -CA + BI: Part I 363
  19. Weak Theories of Operations and Types 441
  20. Computing Bounds from Arithmetical Proofs 469
  21. Backmatter 487
https://doi.org/10.1515/9783110324907.1

Chapters in this book

  1. Frontmatter i
  2. Preface vi
  3. Contents vii
  4. Wolfram Pohlers—Life and Work 1
  5. The Proof Theory of Classical and Constructive Inductive Definitions. A Forty Year Saga, 1968 – 2008 7
  6. A New Approach to Predicative Set Theory 31
  7. Characterising Definable Search Problems in Bounded Arithmetic via Proof Notations 65
  8. On Topological Models of GLP 135
  9. Program Extraction via Typed Realisability for Induction and Coinduction 157
  10. Another Reduction of Classical IDν to Constructive IDiν 183
  11. Elementary Constructive Operational Set Theory 199
  12. Functional Interpretations of Classical Systems 241
  13. Towards a Formal Theory of Computability 257
  14. Σ11 Choice in a Theory of Sets and Classes 283
  15. An Extended Predicative Definition of the Mahlo Universe 315
  16. ITTMs with Feedback 341
  17. Logspace without Bounds 355
  18. Investigations of Subsystems of Second Order Arithmetic and Set Theory in Strength between Π11 -CA and Δ12 -CA + BI: Part I 363
  19. Weak Theories of Operations and Types 441
  20. Computing Bounds from Arithmetical Proofs 469
  21. Backmatter 487
Sign up now to receive a 20% welcome discount
Institutional Access
How does access work?
Have an idea on how to improve our website?
Please write us.
© 2025 De Gruyter Brill
Downloaded on 1.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/9783110324907.1/html?lang=en
Scroll to top button