Proof theory. The first step into impredicativity

DOI10.1007/978-3-540-69319-2zbMath1153.03001MaRDI QIDQ930618

Wolfram Pohlers

Publication date: 1 July 2008

Published in: Universitext (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69319-2

zbMATH Keywords

complexity; recursion; proof theory; formal systems; predicativity; ordinals; inductive definitions; infinitary language; subsystems of analysis

Mathematics Subject Classification ID

03-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations

03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations

03F05: Cut-elimination and normal-form theorems

03F30: First-order arithmetic and fragments

03F35: Second- and higher-order arithmetic and fragments

03F03: Proof theory in general (including proof-theoretic semantics)

03F15: Recursive ordinals and ordinal notations

03F25: Relative consistency and interpretations

Related Items

Effective cut-elimination for a fragment of modal mu-calculus, The Hydra battle and Cichon's principle, Ordinal analysis of non-monotone \(\Pi_1^0\)-definable inductive definitions, Relative Truth Definability of Axiomatic Truth Theories, A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets, A Characterisation of Definable NP Search Problems in Peano Arithmetic