Hostname: page-component-8448b6f56d-qsmjn Total loading time: 0 Render date: 2024-04-20T03:54:14.435Z Has data issue: false hasContentIssue false
  • English
  • Français

Provability in finite subtheories of PA and relative interpretability: a modal investigation

Published online by Cambridge University Press:  12 March 2014

Franco Montagna
Franco Montagna*
Affiliation:
Dipartimento di Matematica, Università di Siena, 53100 Siena, Italy
Get access Rights & Permissions [Opens in a new window]

Extract

By Solovay's theorem [16], the modal logic of provability GL gives a complete description of the propositional schemata involving the provability predicate PrPA(x) for Peano arithmetic PA, which are provable in PA. However, many important aspects of provability cannot be fully expressed in terms of PrPA(x). For this reason, many authors have introduced extensions of GL which take account either of Rosser constructions or of other important metamathematical formulas (see, for example, [5], [6], [14], [16], and [19]). In this paper, we concentrate on the modal logic of the provability predicate for finitely axiomatizable subtheories of PA; the interest of this modal logic is based on the following facts. First of all, it provides a modal translation of a very important property of PA, namely the essential reflexiveness. Secondly, in view of Orey's theorem [10] it constitutes a possible approach to the study of interpretability of finite extensions of PA. Indeed, by Orey's theorem PA + θ is interpretable in PA + θ′ iff for every n, and, therefore, relative interpretability of finitely axiomatizable extensions of PA can be expressed by means of the provability predicate for finitely axiomatizable subtheories of PA.

In §1, we introduce three modal logics extending GL and discuss their arithmetical interpretations; §2 deals with Kripke semantics for two of these logics. In §3, a theorem on arithmetical completeness is shown, which characterizes the logic of the provability predicate for finitely axiomatizable subtheories of PA; a uniform version of this theorem is proved in §4.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 52 , Issue 2 , June 1987 , pp. 494 - 511
Copyright
Copyright © Association for Symbolic Logic 1987

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Boolos, G., The unprovability of consistency: an essay on modal logic, Cambridge University Press, Cambridge, 1979.Google Scholar
[2]Boolos, G., Extremely undecidable sentences, this Journal, vol. 47 (1982), pp. 191–196.Google Scholar
[3]Feferman, S., Arithmetization of metamathematics in a general setting, Fundamenta Mathematicae, vol. 49 (1960), pp. 33–92.CrossRefGoogle Scholar
[4]Guaspari, D., Partially conservative extensions of arithmetic. Transactions of the American Mathematical Society, vol. 254 (1979), pp. 47–68.CrossRefGoogle Scholar
[5]Guaspari, D. and Solovay, R., Rosser sentences, Annals of Mathematical Logic, vol. 16 (1979), pp. 81–99.CrossRefGoogle Scholar
[6]Hájek, P., On interpretability in theories containing arithmetic, Commentationes Mathematicae Unhersitatis Carolinae, vol. 22 (1981), pp. 667–688.Google Scholar
[7]Lindström, P., On partially conservative sentences and interpretability, Proceedings of the American Mathematical Society, vol. 91 (1984), pp. 436–443.CrossRefGoogle Scholar
[8]Montagna, F., On the diagonalizable algebra of Peano arithmetic, Unione Matematica Italiana: Bollettino B, ser. 5, vol. 15 (1978), pp. 303–320.Google Scholar
[9]Montagna, F., Relatively precomplete numerations and arithmetic, Journal of Philosophical Logic, vol. 11 (1982), pp. 419–430.CrossRefGoogle Scholar
[10]Orey, S., Relative interpretations, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 7 (1961), pp. 146–153.CrossRefGoogle Scholar
[11]Sambin, G. and Valentini, S., The modal logic of provability; the sequential approach, Journal of Philosophical Logic, vol. 11 (1982), pp. 311–342.CrossRefGoogle Scholar
[12]Smoryński, C., The incompleteness theorems, Handbook of mathematical logic (Barwise, I., editor), North-Holland, Amsterdam, 1977, pp. 827–865.Google Scholar
[13]Smoryński, C., Calculating self-referential statements: Guaspari sentences of the first kind, this Journal, vol. 46 (1981), pp. 329–344.Google Scholar
[14]Smoryński, C., A ubiquitous fixed point theorem, Interpretability (Szczerba, L. and Prazmowski, K., editors), Bialystok (to appear).Google Scholar
[15]Smoryński, C., Self-reference and modal logic, Springer-Verlag, Berlin, 1985.CrossRefGoogle Scholar
[16]Smoryński, C., Quantified modal logic and self-reference (to appear).Google Scholar
[17]Solovay, R. M., Provability interpretations of modal logic, Israel Journal of Mathematics, vol. 25 (1976), pp. 287–304.CrossRefGoogle Scholar
[18]Švejdar, V., Degrees of interpretability, Commentationes Mathematicae Universitatis Carolinae, vol. 19 (1978), pp. 789–813.Google Scholar
[19]Švejdar, V., Modal analysis of generalized Rosser sentences, this Journal, vol. 48 (1983), pp. 986–999.Google Scholar
[20]Visser, A., Aspects of diagonalization and provability, Dissertation, Utrecht, 1981.Google Scholar