We study the arithmetical schema asserting that every eventually\ud decreasing primitive recursive function has a limit. Some other related\ud principles are also formulated. We establish their relationship with\ud restricted parameter-free induction schemata.\ud Using these results we show that ILM is the logic of II1-conservativity\ud of any reasonable extension of parameter-free II1-induction schema.\ud This result, however, cannot be much improved: by adapting a theorem\ud of D. Zambella and G. Mints we show that the logic of II1-conservativity of primitive recursive arithmetic properly extends ILM.\ud In the third part of the paper we give an ordinal classification of Σn-inconsequences of the standard fragments of Peano arithmetic in terms\ud of reflection principles. This is interesting in view of the general program\ud of ordinal analysis of theories, which in the most standard cases\ud classifies II-classes of sentences (usually II1/1 or II0/2)
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.