On end extensions of models of subsystems of peano arithmetic

https://doi.org/10.1016/S0304-3975(00)00110-9Get rights and content
Under an Elsevier user license
open archive

Abstract

We survey results and problems concerning subsystems of Peano Arithmetic. In particular, we deal with end extensions of models of such theories. First, we discuss the results of Paris and Kirby (Logic Colloquium ’77, North-Holland, Amsterdam, 1978, pp. 199–209) and of Clote (Fund. Math. 127 (1986) 163; Fund. Math. 158 (1998) 301), which generalize the MacDowell and Specker theorem (Proc. Symp. on Foundation of Mathematics, Warsaw, 1959, Pergamon Press, Oxford, 1961, p. 257–263) we also discuss a related problem of Kaufmann (On existence of Σn end extensions, Lecture Notes in Mathematics, Vol. 859, Springer, Berlin, 1980, pp. 92). Then we sketch an alternative proof of Clote's theorem, using the arithmetized completeness theorem in the spirit of McAloon (Trans. Amer. Math. Soc. 239 (1978) 253) and Paris (Some conservation results for fragments of arithmetic, Lecture Notes in Mathematics, Vol. 890, Springer, Berlin, 1981, p. 251).

Keywords

Σn-induction schema
Σn-collection schema
End extension
Σn-ultrafilter
Arithmetized completeness theorem

Cited by (0)