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

Review of Symbolic Logic 2 (4):593-611 (2009)
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 No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/S1755020309990244
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,188
Through your library
References found in this work BETA
Cut-Free Sequent Calculi for Some Tense Logics.Ryo Kashima - 1994 - Studia Logica 53 (1):119 - 135.
The Modal Logic of Provability: Cut-Elimination. [REVIEW]Silvio Valentini - 1983 - Journal of Philosophical Logic 12 (4):471 - 476.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-12-31

Total downloads

30 ( #167,472 of 2,153,830 )

Recent downloads (6 months)

1 ( #398,274 of 2,153,830 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums