Studia Logica 94 (1):47 - 72 (2010)
|Abstract||In this paper we present a sequent calculus for propositional dynamic logic built using an enriched version of the tree-hypersequent method and including an infinitary rule for the iteration operator. We prove that this sequent calculus is theoremwise equivalent to the corresponding Hilbert-style system, and that it is contraction-free and cut-free. All results are proved in a purely syntactic way.|
|Keywords||Contraction-free Cut-free Propositional Dynamic Logic Tree-hypersequent Proof theory|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Rajeev Gore, Linda Postniece & Alwen Tiu, Cut-Elimination and Proof-Search for Bi-Intuitionistic Logic Using Nested Sequents.
Raul Hakli & Sara Negri (2011). Reasoning About Collectively Accepted Group Beliefs. Journal of Philosophical Logic 40 (4):531-555.
Francesca Poggiolesi (2008). A Cut-Free Simple Sequent Calculus for Modal Logic S. Review of Symbolic Logic 1 (1):3-15.
Francesca Poggiolesi (2009). A Purely Syntactic and Cut-Free Sequent Calculus for the Modal Logic of Provability. Review of Symbolic Logic 2 (4):593-611.
Linda Postniece, Combining Derivations and Refutations for Cut-Free Completeness in Bi-Intuitionistic Logic.
Branislav R. Boričić (1986). A Cut-Free Gentzen-Type System for the Logic of the Weak Law of Excluded Middle. Studia Logica 45 (1):39 - 53.
Norbert Gratzl (2010). A Sequent Calculus for a Negative Free Logic. Studia Logica 96 (3):331-348.
Roy Dyckhoff & Luis Pinto (1998). Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. Studia Logica 60 (1):107-118.
Roy Dyckhoff & Sara Negri (2000). Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic. Journal of Symbolic Logic 65 (4):1499-1518.
Added to index2010-01-23
Total downloads10 ( #114,297 of 722,771 )
Recent downloads (6 months)1 ( #60,247 of 722,771 )
How can I increase my downloads?