Archive for Mathematical Logic

, Volume 32, Issue 3, pp 229–238 | Cite as

On the complexity of arithmetical interpretations of modal formulae

  • Lev D. Beklemishev


Mathematical Logic Modal Formula Arithmetical Interpretation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kent, C.: The relation ofA to Prov ⌜A⌝ in the Lindenbaum sentence algebra. J. Sym. Logic,38, 295–298 (1973)Google Scholar
  2. 2.
    Guaspari, D.: Sentences implying their own provability. J. Sym. Logic.48, 777–789 (1983)Google Scholar
  3. 3.
    Smoryński, C.: Self-Reference and Modal Logic. Berlin Heidelberg New York: Springer 1985Google Scholar
  4. 4.
    Visser, A.: A Course in Bimodal Provability Logic. Logic. Group Preprint Series, vol. 20. Department of Philosophy, University of Utrecht, Utrecht 1987Google Scholar
  5. 5.
    de Jong, D., Pianigiani, D.: Solution of a problem of David Guaspari, ITLI Prepublication Series. Amsterdam 1990Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Smoryński, C.: Incompleteness theorems. In: Barwise, J. (ed.) Handbook of Mathematical Logic. North-Holland 1977Google Scholar
  8. 8.
    Solovay, R.: Provability interpretations of modal logic. Isr. J. Math.25, 287–304 (1976)Google Scholar
  9. 9.
    Bennet, C.: On some orderings of extensions of arithmetic. Ph.D. Thesis, Department of Philosophy. Göteborg: University of Göteborg 1986Google Scholar

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Lev D. Beklemishev
    • 1
  1. 1.Steklov Mathematical InstituteMoscow

Personalised recommendations