This is a preview of subscription content, log in via an institution to check access.
References
Kent, C.: The relation ofA to Prov ⌜A⌝ in the Lindenbaum sentence algebra. J. Sym. Logic,38, 295–298 (1973)
Guaspari, D.: Sentences implying their own provability. J. Sym. Logic.48, 777–789 (1983)
Smoryński, C.: Self-Reference and Modal Logic. Berlin Heidelberg New York: Springer 1985
Visser, A.: A Course in Bimodal Provability Logic. Logic. Group Preprint Series, vol. 20. Department of Philosophy, University of Utrecht, Utrecht 1987
de Jong, D., Pianigiani, D.: Solution of a problem of David Guaspari, ITLI Prepublication Series. Amsterdam 1990
Kreisel, G., Lévy, A.: Reflection principles and their use for establishing the complexity of axiom systems. Z. Math. Logik Grundlagen Math.14, 97–142 (1968)
Smoryński, C.: Incompleteness theorems. In: Barwise, J. (ed.) Handbook of Mathematical Logic. North-Holland 1977
Solovay, R.: Provability interpretations of modal logic. Isr. J. Math.25, 287–304 (1976)
Bennet, C.: On some orderings of extensions of arithmetic. Ph.D. Thesis, Department of Philosophy. Göteborg: University of Göteborg 1986
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Beklemishev, L.D. On the complexity of arithmetical interpretations of modal formulae. Arch Math Logic 32, 229–238 (1993). https://doi.org/10.1007/BF01375554
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01375554