Dynamic ordinal analysis

DOI10.1007/S00153-002-0169-4zbMath1025.03058OpenAlexW2052942192WikidataQ126372062 ScholiaQ126372062MaRDI QIDQ1407595

Arnold Beckmann

Publication date: 16 September 2003

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-002-0169-4

zbMATH Keywords

cut eliminationfragments of bounded arithmeticdynamic ordinal analysisorder inductionsemi-formal systemsuccessor induction

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Recursive ordinals and ordinal notations (03F15)

Related Items (6)

Well-behaved principles alternative to bounded induction ⋮ Preservation theorems and restricted consistency statements in bounded arithmetic ⋮ On the computational complexity of cut-reduction ⋮ Phase transitions for Gödel incompleteness ⋮ Separation results for the size of constant-depth propositional proofs ⋮ Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results

This page was built for publication: Dynamic ordinal analysis