Skip to main content
SpringerLink
Log in

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

  • Published:
Studia Logica Aims and scope Submit manuscript

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⊥.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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. S. N. Artemov, Priloženia modal'noj logiki i teorii dokazatel'stv, in Neklassičeskije logiki i ich primenenije, Moskva, 1982, pp. 3–22.

  3. 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. R. Magari, The diagonalizable algebras, Bull. Unione Mat. Ital. 66-B (1975), pp. 117–125.

    Google Scholar 

  5. 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.

  6. A. Visser, An inside view of EXP, or: The closed fragment of the provability logic of (IΔ0+Ω1), Logic Group Preprint Series no. 43, Department of Philosophy, University of Utrecht, Utrecht, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Matematický Ústav, Československá Akademie Věd, Žitná 2, 11567, Praha 1, Czechoslovakia

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

  2. Department of Logic, FF UK, Palachovo nám. 2, 116 38, Praha 1, Czechoslovakia

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

Authors
  1. Petr Hájek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vítězslav Švejdar
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hájek, P., Švejdar, V. A note on the normal form of closed formulas of interpretability logic. Stud Logica 50, 25–28 (1991). https://doi.org/10.1007/BF00370384

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00370384

Keywords

Search

Navigation