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

Studia Logica 50 (1):25 - 28 (1991)
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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370384
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,606
Through your library
References found in this work BETA

Add more references

Citations of this work BETA
The Formalization of Interpretability.Albert Visser - 1991 - Studia Logica 50 (1):81 - 105.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

16 ( #297,659 of 2,168,638 )

Recent downloads (6 months)

1 ( #346,816 of 2,168,638 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums