Advertisement

A Tree-Hypersequent Calculus for the Modal Logic of Provability

  • Francesca PoggiolesiEmail author
Chapter
Part of the Trends in Logic book series (TREN, volume 32)

Abstract

GL, the logic of provability, was elaborated at the end of the 1970s in order to “capture” the properties of the provability predicate of Peano arithmetic in the simple framework of modal logic.

References

  1. 74.
    D. Leivant. On the proof theory of the modal logic for arithmetic provability. Journal of Symbolic Logic, 46:531–538, 1981.CrossRefGoogle Scholar
  2. 85.
    S. Negri. Proof analysis in modal logic. Journal of Philosophical Logic, 34:507–544, 2005.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  1. 1.VRIJE UNIVERSITEIT BRUSSEL CLWF/LWBrusselsBelgium

Personalised recommendations