Abstract.
Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmetic. In this paper we will define dynamic ordinals – they will be sets of number theoretic functions measuring the amount of sΠb 1(X) order induction available in a theory. We will compare order induction to successor induction over weak theories. We will compute dynamic ordinals of the bounded arithmetic theories sΣb n (X)−LmIND for m=n and m=n+1, n≥0. Different dynamic ordinals lead to separation. In this way we will obtain several separation results between these relativized theories. We will generalize our results to further languages extending the language of bounded arithmetic.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 27 April 2001 / Published online: 19 December 2002
The results for sΣb n (X)−LmIND are part of the authors dissertation [3]; the results for sΣb m (X)−Lm+1IND base on results of ARAI [1].
Mathematics Subject Classification (2000): Primary 03F30; Secondary 03F05, 03F50
Key words or phrases: Dynamic ordinal – Bounded arithmetic – Proof-theoretic ordinal – Order induction – Semi-formal system – Cut-elimination
Rights and permissions
About this article
Cite this article
Beckmann, A. Dynamic ordinal analysis. Arch. Math. Logic 42, 303–334 (2003). https://doi.org/10.1007/s00153-002-0169-4
Issue Date:
DOI: https://doi.org/10.1007/s00153-002-0169-4