Cut elimination for shallow modal logics

Date

Authors

Lellmann, Bjorn

Pattinson, Dirk

Publisher

Springer

Abstract

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

Keywords

Keywords: Cut elimination; Decision procedure; Finite set; Modal logic; Modal rules; Rule set; Sequent calculus; Subformulas; Biomineralization; Computability and decidability; Differentiation (calculus); Problem solving; Automata theory

URI

http://hdl.handle.net/1885/83159

Collections

ANU Research Publications

Source

International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)

Type

Conference paper

DOI

10.1007/978-3-642-22119-4_17

Restricted until

2037-12-31

Downloads

File

Description

01_Lellmann_Cut_elimination_for_shallow_2011.pdf (217 KB)