Abstract
Roughly, a bounded formula Φ(x) is (2C,c)-conservative if assuming Φ(2C) gives no new bounded information on c (c being a constant for a non-standard element in Peano arithmetic PA). Similarly for iterated powers of 2. This notion is analyzed, various existence theorems are proved and, as a corollary, we obtain a strengthening of Second Gödel's Incompleteness Theorem saying that for each non-standard model M of PA and each non-standard element a ε M there is a model K of PA coinciding with M up to a and such that in K there is a very short proof of constradiction (bounded by 2 to the 2 to the 2 to the c).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Feferman: Arithmetization of metamathematics in a general setting, Fund. Math. 49 (1960), 35–92.
D. Guaspari: Partially conservative extensions of arithmetic, Trans. Amer. Math. Soc. 25 (1970), 47–68.
P. Hájek: On partially conservative extensions of arithmetic, in: Logic Colloquium 78, North-Holland P.C., 1979, Amsterdam.
P. Lindström: Notes on partially conservative sentences and interpretability, Phil. Comm. Red Series, No.13, Göteborg 1980.
K. McAloon: Completeness theorems, incompleteness theorems and models of arithmetic, Trans. A. M. S. 239 (1978) 253–277.
J. Paris, C. Dimitracopoulos: Truth definitions for Δ formulas in: Logic et algoritmic, Geneve 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Hájek, P. (1984). On a new notion of partial conservativity. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099487
Download citation
DOI: https://doi.org/10.1007/BFb0099487
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13901-0
Online ISBN: 978-3-540-39119-7
eBook Packages: Springer Book Archive