On the limit existence principles in elementary arithmetic and Σn0-consequences of theories

Dedicated to Wolfram Pohlers on the occasion of his 60-th birthday
https://doi.org/10.1016/j.apal.2005.05.005Get rights and content
Under an Elsevier user license
open archive

Abstract

We study the arithmetical schema asserting that every eventually decreasing elementary recursive function has a limit. Some other related principles are also formulated. We establish their relationship with restricted parameter-free induction schemata. We also prove that the same principle, formulated as an inference rule, provides an axiomatization of the Σ2-consequences of IΣ1.

Using these results we show that ILM is the logic of Π1-conservativity of any reasonable extension of parameter-free Π1-induction schema. This result, however, cannot be much improved: by adapting a theorem of D. Zambella and G. Mints we show that the logic of Π1-conservativity of primitive recursive arithmetic properly extends ILM.

In the third part of the paper we give an ordinal classification of Σn0-consequences of the standard fragments of Peano arithmetic in terms of reflection principles. This is interesting in view of the general program of ordinal analysis of theories, which in the most standard cases classifies Π-classes of sentences (usually Π11 or Π20).

Keywords

Elementary arithmetic
Parameter-free induction
Inference rule
Interpretability logic
Conservativity
Reflection principles
Ordinal analysis

Cited by (0)