10 search results - page 1 / 2 » Generic Modal Cut Elimination Applied to Conditional Logics |
TABLEAUX
2009
Springer
13 years 11 months ago
2009
Springer
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 ...
IANDC
2010
13 years 3 months ago
2010
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
TABLEAUX
2009
Springer
13 years 11 months ago
2009
Springer
We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a c...
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...