Abstract
This paper contains a careful derivation of principles of Interpretability Logic valid in extensions of IΔ0+Ω1.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Artemov, 1986, On Modal Logics axiomatizing Provability, Math. USSR Izvestia, Vol 27, No.3, 401–429.
Bennet, J.H., 1962, On spectra, Thesis, Princeton University, Princeton.
Buss, S., 1985, Bounded Arithmetic, Thesis, Princeton University, Princeton. Reprinted: 1986, Bibliopolis, Neapoli.
Berarducci, A., The interpretability Logic of Peano Arithmetic, Manuscript, 1988.
Feferman, S., 1960, em Arithmetization of metamathematics in a general setting, Fund. Math. 49, 33–92.
Friedman, H., ?, Translability and relative consistency II.
Gaifman, H. & Dimitracopoulos, C., 1982, Fragments of Peano's Arithmetic and the MRDP theorem, in: Logic and Algorithmic, Monography 30 de 30 de l'Enseignement Mathematique, Genève, 187–206.
Guaspari, D., 1979, Partially conservative extensions of arithmetic, Transactions of the AMS 254, 47–68.
Hájek, P., 1971, On interpretability in set theories I, Commentationes Mathematicae Universitatis Carolinae 12, 73–79.
Hájek, P., 1972, On interpretability in set theories II, Commentationes Mathematicae Universitatis Carolinae 13, 445–455.
Hájek, P., 1979, On partially conservative extensions of arithmetic, in: Barwise, J. & al eds., Logic Colloquium '78, North Holland, Amsterdam, 225–234.
Hájek, P., 19781, Interpretability in theories containing arithmetic II, Commentationes Mathematicae Universitatis Carolinae 22, 667–688.
Hájek, P., ?, On partially conservative extensions of arithmetic.
Hájek, P., ?, Positive results on fragments of arithmetic.
Hájek, P., ?, On logic in fragments of arithmetic.
Hájek, P., & Hájková, M., 1972, On interpretability in theories containing arithmetic, Fundamenta Mathematicae 76, 131–137.
Hájek, P., & Montagna, M., 1989, ILM is the logic of II1 -conservativity, manuscript.
Hájek, P., & Svejdar, V., 1989, A note on the normal form of closed formulas of Interpretability Logic, manuscript.
Jongh, D.H.J. de & Veltman, F., 1988, Provability logics for relative interpretability, ITLI Prepublication Series, ML-88-03; to appear in the Proceedings of the Heyting Conference, Bulgaria, 1988.
Jongh, D.H. J. de & Visser, A., 1989, Explicit Fixed Points in Interpretability Logic, Logic Group Preprint Series 44, Department of Philosophy, University of Utrecht.
Kalsbeek, M.B., 1988, An Orey Sentence for Predicative Arithmetic, ITLI Prepublication Series X-8-01.
Lindström, P., 1979, Some results on interpretability, in: Proceedings of the 5th Scandinavian Logic Symposium, Aalborg, 329–361.
Lindström, P., 1980, Notes on partially conservative sentences and interpretability, Philosophical Communications, Red Series no 13, Göteborg.
Lindström, P., 1981, Remarks on provability and interpretability, Philosophical Communications, Red Series no 15, Göteborg.
Lindström, P., 1982, More on partially conservative sentences and interpretability, Philosophical Communications, Red Series no 17, Göteborg.
Lindström, P., 1984a, On faithful interpretability, in: Richter, M.M. & al eds., Computation and Proof Theory, Logic Colloquium '83, Lecture Notes in Mathematics 1104, Springer Verlag, Berlin, 279–288.
Lindström, P., 1984b, On certain lattices of degrees of interpretability, Notre Dame Journal of Formal Logic 25, 127–140.
Lindström, P., 1984c, On partially conservative sentences and interpretability, Proceedings of the AMS 91, 436–443.
Lindström, P., 1984d, Provability and interpretability in theories containing arithmetic, Atti degli incontri di logica matematica 2, 432–451.
Nelson, E., 1986, Predicative Arithmetic, Math Notes 32, Princeton University Press, Princeton.
Orey, S., 1961, Relative Interpretations, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 7, 146–153.
Parikh, R., 1971, Existence and feasibility in arithmetic, JSL 36, 494–508.
Paris, J.B., Dimitracopoulos, C., 1983, A note on the undefinability of cuts, JSL 48, 564–569.
Paris, J.B., Wilkie, A., 1987, On the scheme of induction for bounded arithmetic formula, Annals for Pure and Applied Logic 35, 261–302.
Pudlák, P., 1983a, Some prime elements in the lattice of interpretability types, Transactions of the AMS 280, 255–275.
Pudlák, P., 1983b, A definition of exponentiation by a bounded arithmetical formula, Commentationes Mathematicae Universitatis Carolinae 24, 667–671.
Pudlák, P., 1985, Cuts, consistency statements and interpretability, JSL 50, 423–441.
Shavrukov, V., Yu., 1988, The Logic of Relative Interpretability over Peano Arithmetic, Preprint 5 of the Steklov Mathematical Institute.
Smorynski, C., 1985a, Self-Reference and Modal Logic, Springer Verlag.
Smorynski, C., 1985b, Nonstandard models and related developments in the work of Harvey Friedman, in: Harrington, L.A. & alii eds., Harvey Friedman's Research on the Foundations of Mathematics, North Holland, 212–229.
Solvay, R., ?, On interpretability in set theories.
Svejdar, V., 1978, Degrees of interpretability, Commentationes Mathematicae Universitatis Carolinae 19, 789–813.
Svejdar, V., 1981, A sentence that is difficult to interpret, Commentationes Mathematicae Universitatis Carolinae 22, 661–666.
Svejdar, V., 1983, Modal analysis of generalized Rosser sentences, JSL 48, 986–999.
Svejdar, V., 1989, Some independence results in Interpretability Logic, manuscript.
Takeuti, G., 1988, Bounded arithmetic and truth definition, Annals of Pure & Applied Logic 36, 75–104.
Tarski, A., Mostowski, A., Robinson, R.M., 1953, Undecidable theories, North Holland, Amsterdam.
Visser, A., 1984, The provability logics of recursively enumerable theories extending Peano Arithmetic at arbitrary theories extending Peano Arithmetic, Journal of Philosophical Logic 13, 79–113.
Visser, A., 1988a, Preliminary Notes on Interpretability Logic, Logic Group Preprint Series no 29, Dep. of Philosophy, University of Utrecht, Heidelberglaan 2, 3584CS Utrecht.
Visser, A., 1988b, Interpretability Logic, Logic Group Preprint Series no 40, Dep. of Philosophy, University of Utrecht, Heidelberglaan 2, 3584CS Utrecht. To appear in the Proceedings of the Heyting Conference, Bulgaria, 1988.
Visser, A., 1989, An inside view of EXP: the dosed fragment of the provability logic of IΔ0+Ω1 with a propositional constant for EXP, Logic Group Preprint Series no 43, Dep. of Philosophy, University of Utrecht, Heidelberglaan 2, 3584CS Utrecht.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Visser, A. The formalization of Interpretability. Stud Logica 50, 81–105 (1991). https://doi.org/10.1007/BF00370389
Issue Date:
DOI: https://doi.org/10.1007/BF00370389