Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
- 1 December 1995
- journal article
- Published by Cambridge University Press (CUP) in Bulletin of Symbolic Logic
- Vol. 1 (4), 468-485
- https://doi.org/10.2307/421132
Abstract
§1. Introduction. The purpose of this paper is, in general, to report the state of the art of ordinal analysis and, in particular, the recent success in obtaining an ordinal analysis for the system of-analysis, which is the subsystem of formal second order arithmetic, Z2, with comprehension confined to-formulae. The same techniques can be used to provide ordinal analyses for theories that are reducible to iterated-comprehension, e.g.,-comprehension. The details will be laid out in [28].Ordinal-theoretic proof theory came into existence in 1936, springing forth from Gentzen's head in the course of his consistency proof of arithmetic. Gentzen fostered hopes that with sufficiently large constructive ordinals one could establish the consistency of analysis, i.e., Z2. Considerable progress has been made in proof theory since Gentzen's tragic death on August 4th, 1945, but an ordinal analysis of Z2is still something to be sought. However, for reasons that cannot be explained here,-comprehension appears to be the main stumbling block on the road to understanding full comprehension, giving hope for an ordinal analysis of Z2in the foreseeable future.Roughly speaking,ordinally informativeproof theory attaches ordinals in a recursive representation system to proofs in a given formal system; transformations on proofs to certain canonical forms are then partially mirrored by operations on the associated ordinals. Among other things, ordinal analysis of a formal system serves to characterize its provably recursive ordinals, functions and functionals and can yield both conservation and combinatorial independence results.Keywords
This publication has 28 references indexed in Scilit:
- The strength of some Martin-Löf type theoriesArchive for Mathematical Logic, 1994
- Collapsing functions based on recursively large ordinals: A well-ordering proof for KPMArchive for Mathematical Logic, 1994
- Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher BäumeArchive for Mathematical Logic, 1985
- Introduction to ?2 1 -logicSynthese, 1985
- A well-ordering proof for Feferman's theoryT 0Archive for Mathematical Logic, 1983
- Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1Archive for Mathematical Logic, 1981
- On the strength of several versions of Dirichlet's (“pigeon-hole”-)principle in the sense of first-order logicArchive for Mathematical Logic, 1981
- Beweistheorie vonKPNArchive for Mathematical Logic, 1980
- Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten TypenlogikArchive for Mathematical Logic, 1964
- Beweistheoretische Erfassung der unendlichen Induktion in der ZahlentheorieMathematische Annalen, 1950