Abstract
We consider interpretations of modal logic in Peano arithmetic (P) determined by an assignment of a sentencev * ofP to each propositional variablev. We put (⊥)*=“0 = 1”, (χ → ψ)* = “χ* → ψ*” and let (□ψ)* be a formalization of “ψ)* is a theorem ofP”. We say that a modal formula, χ, isvalid if ψ* is a theorem ofP in each such interpretation. We provide an axiomitization of the class of valid formulae and prove that this class is recursive.
Similar content being viewed by others
References
George Boolos,Friedman’s 35th problem has an affirmative solution, Abstract*75T-E66, Notices Amer. Math. Soc.22 (1975), A-646.
Harvey Friedman,One hundred and two problems in mathematical logic, J. Symbolic Logic40 (1975), 113–129.
S. C. Kleene,Introduction to Metamathematics, Van Nostrand, New York, 1952.
Saul Kripke,Semantical analysis of modal logic I, Z. Math. Logik Grundlagen Math.9 (1963), 67–96.
M. H. Löb,Solution of a problem of Leon Henkin, J. Symbolic Logic20 (1955), 115–118.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Solovay, R.M. Provability interpretations of modal logic. Israel J. Math. 25, 287–304 (1976). https://doi.org/10.1007/BF02757006
Issue Date:
DOI: https://doi.org/10.1007/BF02757006