Skip to search formSkip to main contentSkip to account menu

Interpretability logic

Interpretability logics comprise a family of modal logics that extend provability logic to describe interpretability or various related… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Arithmetical hierarchyModal logicProvability logic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Provability and Interpretability Logics with Restricted Realizations
The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We… 
2015
2015
Improved stratigraphic interpretation using broadband processing – Sergipe Basin, Brazil
Mike Saunders, Laurie Geiger, Dan Negri, Jaime A. Stein, T. Altay Sansal and John Springman demonstrate that de-ghosting and… 
2014
2014
A bisimulation characterization for interpretability logic
A first–order formula is equivalent to the standard first–order translation of some formula of interpretability logic with… 
2004
2004
FRIwE: fuzzy rule identification with exceptions
In this paper, the FRIwE method is proposed to identify fuzzy models from examples. Such a method has been developed trying to… 
2004
2004
How to Derive Principles of Interpretability Logic A Toolkit
In this paper, we develop a toolkit to derive principles for the interpetability logic of all reasonable theories by fine-tuning… 
1998
1998
The interpretability logic ILF
In this paper we determine a characteristic class of ILsetframes for the principle F. Then we prove that the principle P is not… 
1998
1998
interpolation and bisimulation in temporal logic
Building on recent model theoretic results for Since-Until logics we define an adequate notion of bisimulation and establish… 
1992
1992
On the Proofs of Arithmetical Completeness for Interpretability Logic
  • D. Zambella
  • Notre Dame J. Formal Log.
  • 1992
  • Corpus ID: 26351827
Visser proved that ILP is the interpretability logic of any finitely axiomatizable theory containing IΔ 0 4- SUPEXP, Berarducci… 
1991
1991
A note on the normal form of closed formulas of interpretability logic
Each closed (i.e. variable free) formula of interpretability logic is equivalent in ILF to a closed formula of the provability… 
1991
1991
Some independence results in interpretability logic
A Kripke-style semantics developed by de Jongh and Veltman is used to investigate relations between several extensions of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)