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.
Publisher
Cambridge University Press (CUP)
Subject
Logic,Philosophy,Mathematics (miscellaneous)
Reference13 articles.
1. Sequent Systems for Modal Logics
2. Sequent Calculi for Normal Modal Propositional Logics
3. Löb’s axiom and cut-elimination theorem;Sasaki;Journal of the Nanzan Academic Society Mathematical Sciences and Information Engineering,2001
4. Reflecting the semantic features of S5 at the syntactic level;Poggiolesi;SILFS Conference Proceedings,2009
5. The Method of Tree-Hypersequents for Modal Propositional Logic
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献