Cut Elimination for Shallow Modal Logics
暂无分享,去创建一个
[1] András Simon,et al. Decidable and undecidable logics with a binary modality , 1995, J. Log. Lang. Inf..
[2] Dirk Pattinson,et al. PSPACE Bounds for Rank-1 Modal Logics , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).
[3] Dirk Pattinson,et al. Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics , 2008, FoSSaCS.
[4] Dov M. Gabbay,et al. Handbook of Philosophical Logic , 2002 .
[5] Arnon Avron,et al. Canonical Propositional Gentzen-Type Systems , 2001, IJCAR.
[6] Camilla Schwind,et al. A sequent calculus and a theorem prover for standard conditional logics , 2007, TOCL.
[7] Helmut Schwichtenberg,et al. Basic proof theory , 1996, Cambridge tracts in theoretical computer science.
[8] Camilla Schwind,et al. A Calculus and Complexity Bound for Minimal Conditional Logic , 2001, ICTCS.
[9] Ian Stark,et al. Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.
[10] Helmut Schwichtenberg,et al. Basic proof theory (2nd ed.) , 2000 .
[11] João Rasga. Sufficient conditions for cut elimination with complexity analysis , 2007, Ann. Pure Appl. Log..
[12] Larry Wos,et al. What Is Automated Reasoning? , 1987, J. Autom. Reason..
[13] Dirk Pattinson,et al. Generic Modal Cut Elimination Applied to Conditional Logics , 2009, TABLEAUX.
[14] Heinrich Zimmermann,et al. Efficient Loop-Check for Backward Proof Search in Some Non-classical Propositional Logics , 1996, TABLEAUX.
[15] Mogens Nielsen,et al. Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.
[16] Richard Edwin Stearns,et al. Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.
[17] Alexander Leitsch,et al. Towards an algorithmic construction of cut-elimination procedures , 2008, Math. Struct. Comput. Sci..