Abstract
We introduce constructive and classical systems for nonstandard arithmetic and show how variants of the functional interpretations due to Gödel and Shoenfield can be used to rewrite proofs performed in these systems into standard ones. These functional interpretations show in particular that our nonstandard systems are conservative extensions of E-HAω and E-PAω, strengthening earlier results by Moerdijk and Palmgren, and Avigad and Helzner. We will also indicate how our rewriting algorithm can be used for term extraction purposes. To conclude the paper, we will point out some open problems and directions for future research, including some initial results on saturation principles.
Original language | English |
---|---|
Pages (from-to) | 1962-1994 |
Number of pages | 33 |
Journal | Annals of Pure and Applied Logic |
Volume | 163 |
Issue number | 12 |
DOIs | |
Publication status | Published - 2012 |