Graduate studies at Western
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)|
|Through your library||Configure|
Similar books and articles
Paolo Gentilini (1999). Proof-Theoretic Modal PA-Completeness II: The Syntactic Countermodel. Studia Logica 63 (2):245-268.
Rajeev Gore, Linda Postniece & Alwen Tiu, Cut-Elimination and Proof-Search for Bi-Intuitionistic Logic Using Nested Sequents.
Francesca Poggiolesi (2008). A Cut-Free Simple Sequent Calculus for Modal Logic S. Review of Symbolic Logic 1 (1):3-15.
Roy Dyckhoff & Luis Pinto (1998). Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. Studia Logica 60 (1):107-118.
Sara Negri (2005). Proof Analysis in Modal Logic. Journal of Philosophical Logic 34 (5/6):507 - 544.
George Tourlakis (2010). On the Proof-Theory of Two Formalisations of Modal First-Order Logic. Studia Logica 96 (3):349-373.
Norbert Gratzl (2010). A Sequent Calculus for a Negative Free Logic. Studia Logica 96 (3):331-348.
Linda Postniece, Combining Derivations and Refutations for Cut-Free Completeness in Bi-Intuitionistic Logic.
Added to index2009-12-31
Total downloads18 ( #74,554 of 738,079 )
Recent downloads (6 months)1 ( #61,269 of 738,079 )
How can I increase my downloads?