Eliminability of cut in hypersequent calculi for some modal logics of linear frames
暂无分享,去创建一个
[1] M. de Rijke,et al. Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.
[2] Roy Dyckhoff,et al. Proof analysis in intermediate logics , 2012, Arch. Math. Log..
[3] Francesca Poggiolesi,et al. Gentzen Calculi for Modal Propositional Logic , 2010 .
[4] A. Avron. The method of hypersequents in the proof theory of propositional non-classical logics , 1996 .
[5] R. Goldblatt. Logics of Time and Computation , 1987 .
[6] Haskell B. Curry,et al. Foundations of Mathematical Logic , 1964 .
[7] Sara Negri,et al. Structural proof theory , 2001 .
[8] Ori Lahav,et al. From Frame Properties to Hypersequent Rules in Modal Logics , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.
[9] Franco Montagna,et al. Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions , 2010, Fuzzy Sets Syst..
[10] Christian G. Fermüller,et al. Hypersequent Calculi for Gödel Logics - a Survey , 2003, J. Log. Comput..
[11] Matthias Baaz,et al. A Schütte-Tait Style Cut-Elimination Proof for First-Order Gödel Logic , 2002, TABLEAUX.
[12] Francesca Poggiolesi,et al. A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5 , 2008, The Review of Symbolic Logic.
[13] D. Gabbay,et al. Proof Theory for Fuzzy Logics , 2008 .
[14] Arnon Avron,et al. Hypersequents, logical consequence and intermediate logics for concurrency , 1991, Annals of Mathematics and Artificial Intelligence.
[15] Arnon Avron,et al. A constructive analysis of RM , 1987, Journal of Symbolic Logic.
[16] Andrzej Indrzejczak,et al. Natural Deduction, Hybrid Systems and Modal Logics , 2010 .