Skip navigation
Skip navigation

Cut elimination for shallow modal logics

Lellmann, Bjorn; Pattinson, Dirk


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

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
Source: International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)
DOI: 10.1007/978-3-642-22119-4_17


File Description SizeFormat Image
01_Lellmann_Cut_elimination_for_shallow_2011.pdf217 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator