Dynamic ordinal analysis

DOI10.1007/S00153-002-0169-4MaRDI QIDQ1407595zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Proofs, Programs and Abstract Complexity
• Generalised dynamic ordinals -- universal measures for implicit computational complexity
• scientific article; zbMATH DE number 5057388
• scientific article; zbMATH DE number 432700
• A Model-Theoretic Approach to Ordinal Analysis

Cited in

(12)

• scientific article; zbMATH DE number 1980917 (Why is no real title available?)
• Phase transitions for Gödel incompleteness
• Preservation theorems and restricted consistency statements in bounded arithmetic
• Ordinal analysis by transformations
• Distance-Based Analysis of Ordinal Data and Ordinal Time Series
• Ordinal imitative dynamics
• Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
• Separation results for the size of constant-depth propositional proofs
• Proofs, Programs and Abstract Complexity
• On the computational complexity of cut-reduction
• Generalised dynamic ordinals -- universal measures for implicit computational complexity
• Well-behaved principles alternative to bounded induction

This page was built for publication: Dynamic ordinal analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407595)