Skip to Main content Skip to Navigation
Journal articles

A purely syntactic and cut-free sequent calculus for the modal logic of provability

Abstract : In this paper we present a sequent calculus for the modal propositional logic GL (the logic of provability) obtained by means of the tree-hypersequent method, a method in which the metalinguistic strength of hypersequents is improved, so that we can simulate trees shapes. We prove that this sequent calculus is sound and complete with respect to the Hilbert-style system GL, that it is contraction free and cut free and that its logical and modal rules are invertible. No explicit semantic element is used in the sequent calculus and all the results are proved in a purely syntactic way.
Keywords : mathematics logic
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Francesca Poggiolesi Connect in order to contact the contributor
Submitted on : Tuesday, June 26, 2018 - 6:33:39 PM
Last modification on : Wednesday, November 17, 2021 - 12:30:35 PM
Long-term archiving on: : Wednesday, September 26, 2018 - 11:33:59 PM


Files produced by the author(s)


  • HAL Id : halshs-00775808, version 1


Francesca Poggiolesi. A purely syntactic and cut-free sequent calculus for the modal logic of provability. The review of symbolic logic, Cambridge University Press, 2009, 2 (4), pp.593-611. ⟨halshs-00775808⟩



Les métriques sont temporairement indisponibles