Cut elimination for shallow modal logics
Motivated by the fact that nearly all conditional logics are axiomatised by so-called shallow axioms (axioms with modal nesting depth ≤ 1) we investigate sequent calculi and cut elimination for modal logics of this type. We first provide a generic trans
|Collections||ANU Research Publications|
|Source:||International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)|
|01_Lellmann_Cut_elimination_for_shallow_2011.pdf||217 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.