Interpretability logic

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Interpretability logics comprise a family of modal logics that extend provability logic to describe interpretability and/or various related metamathematical properties and relations such as weak interpretability, Π1-conservativity, cointerpretability, tolerance, cotolerance and arithmetic complexities.

Main contributors to the field are Alessandro Berarducci, Petr Hájek, Konstantin Ignatiev, Giorgi Japaridze, Franco Montagna, Vladimir Shavrukov, Rineke Verbrugge, Albert Visser and Domenico Zambella.

[edit] References

  • Giorgi Japaridze and Dick de Jongh, The Logic of Provability. In Handbook of Proof Theory, S.Buss, ed. Elsevier, 1998, pp. 475-546.
Personal tools
Namespaces
Variants
Actions
Navigation
Interaction
Toolbox
Print/export
Languages