Ways of Proof Theory / / ed. by Ralf Schindler.

• Superior document: Title is part of eBook package: De Gruyter DGBA Backlist Complete English Language 2000-2014 PART1
• MitwirkendeR: Avron, Arnon,; Beckmann, Arnold,; Beklemishev, Lev,; Berger, Ulrich,; Bezhanishvili, Guram,; Buchholz, Wilfried,; Buss, Samuel R.,; Cantini, Andrea,; Crosilla, Laura,; Diller, Justus,; Feferman, Solomon,; Huber, Simon,; Icard, Thomas,; Jäger, Gerhard,; Kahle, Reinhard,; Karádais, Basil A.,; Krähenbühl, Jürg,; Lubarsky, Robert S.,; Oitavem, Isabel,; Rathjen, Michael,; Schwichtenberg, Helmut,; Seisenberger, Monika,; Setzer, Anton,; Strahm, Thomas,; Wainer, Stanley S.,
• HerausgeberIn: Schindler, Ralf,
• Place / Publishing House: Berlin ;, Boston : : De Gruyter, , [2013]; ©2010
• Year of Publication: 2013
• Language: English
• Series: Ontos Mathematical Logic , 2
• Physical Description: 1 online resource (498 p.) :; Zahlr. Abb.

On the occasion of the retirement of Wolfram Pohlers the Institut für Mathematische Logik und Grundlagenforschung of the University of Münster organized a colloquium and a workshop which took place July 17 – 19, 2008. This event brought together proof theorists from many parts of the world who have been acting as teachers, students and collaborators of Wolfram Pohlers and who have been shaping the field of proof theory over the years. The present volume collects papers by the speakers of the colloquium and workshop; and they produce a documentation of the state of the art of contemporary proof theory.

Table of Contents

Frontmatter -- Preface -- Contents -- Wolfram Pohlers—Life and Work -- The Proof Theory of Classical and Constructive Inductive Definitions. A Forty Year Saga, 1968 – 2008 -- A New Approach to Predicative Set Theory -- Characterising Definable Search Problems in Bounded Arithmetic via Proof Notations -- On Topological Models of GLP -- Program Extraction via Typed Realisability for Induction and Coinduction -- Another Reduction of Classical IDν to Constructive IDiν -- Elementary Constructive Operational Set Theory -- Functional Interpretations of Classical Systems -- Towards a Formal Theory of Computability -- Σ11 Choice in a Theory of Sets and Classes -- An Extended Predicative Definition of the Mahlo Universe -- ITTMs with Feedback -- Logspace without Bounds -- Investigations of Subsystems of Second Order Arithmetic and Set Theory in Strength between Π11 -CA and Δ12 -CA + BI: Part I -- Weak Theories of Operations and Types -- Computing Bounds from Arithmetical Proofs -- Backmatter