Generic modal cut elimination applied to conditional logics
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide
|Collections||ANU Research Publications|
|Source:||Logical Methods in Computer Science|
|DOI:||10.2168/LMCS-7 (1:4) 2011|
|Access Rights:||Open Access|
|01_Pattinson_Generic_modal_cut_elimination_2011.pdf||261.17 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.