On the complexity of epistemic reasoning
Proceedings of the Fourth Annual Symposium on Logic in computer science
Efficient Loop-Check for Backward Proof Search in Some Non-classical Propositional Logics
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Canonical Propositional Gentzen-Type Systems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A sequent calculus and a theorem prover for standard conditional logics
ACM Transactions on Computational Logic (TOCL)
Admissibility of Cut in Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
From Axioms to Analytic Rules in Nonclassical Logics
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Shallow Models for Non-iterative Modal Logics
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
Optimizing Conditional Logic Reasoning within CoLoSS
Electronic Notes in Theoretical Computer Science (ENTCS)
Cut elimination in coalgebraic logics
Information and Computation
Cut elimination for shallow modal logics
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
| Hi-index | 0.00 |
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 variety of logics outside the realm of normal modal logic. We give extensive example instantiations of our framework to various conditional logics. For these, we obtain fully internalised calculi which are substantially simpler than those known in the literature, along with leaner proofs of cut elimination and complexity. In one case, conditional logic with modus ponens and conditional excluded middle, cut elimination and complexity are explicitly stated as open in the literature.