Lellmann, BjornPattinson, Dirk2015-12-109783642360381http://hdl.handle.net/1885/65952We consider a general format for sequent rules for not necessarily normal modal logics based on classical or intuitionistic propositional logic and provide relatively simple local conditions ensuring cut elimination for such rule sets. The rule format encompasses e.g. rules for the boolean connectives and transitive modal logics such as S4 or its constructive version. We also adapt the method of constructing suitable rule sets by saturation to the intuitionistic setting and provide a criterium for translating axioms for intuitionistic modal logics into sequent rules. Examples include constructive modal logics and conditional logic.Keywords: Boolean connectives; Constructive modal logic; Cut elimination; Intuitionistic logic; Local conditions; Modal logic; Propositional logic; Rule formats; Rule set; Artificial intelligence; Formal logic201310.1007/978-3-642-36039-8-142016-02-24