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

Studia Logica 50 (1):25 - 28 (1991)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,075

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
34 (#471,090)

6 months
6 (#524,433)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The formalization of interpretability.Albert Visser - 1991 - Studia Logica 50 (1):81 - 105.
On the share of closed IL formulas which are also in GL.Vedran Čačić & Vjekoslav Kovač - 2015 - Archive for Mathematical Logic 54 (7-8):741-767.

Add more citations

References found in this work

Add more references