Studia Logica

, Volume 50, Issue 1, pp 25–28 | Cite as

A note on the normal form of closed formulas of interpretability logic

  • Petr Hájek
  • Vítězslav Švejdar

Abstract

Each closed (i.e. variable free) formula of interpretability logic is equivalent in ILF to a closed formula of the provability logic G, thus to a Boolean combination of formulas of the form □n⊥.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Art1]
    S. N. Artemov, Aritmetičeski polnyje teorii (Arithmetically complete modal theories), Semiotika i Informatika 14 (1980), pp. 115–133. (Translation in AMS Transl (2), vol. 135, 1987, pp. 39–54.)Google Scholar
  2. [Art2]
    S. N. Artemov, Priloženia modal'noj logiki i teorii dokazatel'stv, in Neklassičeskije logiki i ich primenenije, Moskva, 1982, pp. 3–22.Google Scholar
  3. [Bool]
    G. Boolos, On deciding the truth of certain statements involving the notion of consistency, Journal of Symbolic Logic 41 (1976), pp. 33–35.Google Scholar
  4. [Mag]
    R. Magari, The diagonalizable algebras, Bull. Unione Mat. Ital. 66-B (1975), pp. 117–125.Google Scholar
  5. [Vi88]
    A. Visser, Interpretability logic, Logic Group Preprint Series no. 40, Department of Philosophy, University of Utrecht, Utrecht, to appear in Proceedings of the Heyting Conference, Chaika, Bulgaria, 1988.Google Scholar
  6. [Vi89]
    A. Visser, An inside view of EXP, or: The closed fragment of the provability logic of (IΔ01), Logic Group Preprint Series no. 43, Department of Philosophy, University of Utrecht, Utrecht, 1989.Google Scholar

Copyright information

© Polish Academy of Sciences 1991

Authors and Affiliations

  • Petr Hájek
    • 1
    • 2
  • Vítězslav Švejdar
    • 1
    • 2
  1. 1.Matematický ÚstavČeskoslovenská Akademie VědPraha 1Czechoslovakia
  2. 2.Department of LogicFF UKPraha 1Czechoslovakia

Personalised recommendations