Basic proof theory
Specifying coalgebras with modal logic
Theoretical Computer Science
Modal logic
Gentzen-type systems and resolution rules. Part I. Propositional logic
COLOG '88 Proceedings of the International Conference on Computer Logic
A New Method for Bounding the Complexity of Modal Logics
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
PSPACE Bounds for Rank-1 Modal Logics
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
A sequent calculus and a theorem prover for standard conditional logics
ACM Transactions on Computational Logic (TOCL)
A Coalgebraic Perspective on Monotone Modal Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Rank-1 modal logics are coalgebraic
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
A finite model construction for coalgebraic modal logic
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Generic Modal Cut Elimination Applied to Conditional Logics
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Optimizing Conditional Logic Reasoning within CoLoSS
Electronic Notes in Theoretical Computer Science (ENTCS)
Optimal tableau algorithms for coalgebraic logics
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
| Hi-index | 0.00 |
We study sequent calculi for propositional modal logics, interpreted over coalgebras, with admissibility of cut being the main result. As applications we present a new proof of the (already known) interpolation property for coalition logic and establish the interpolation property for the conditional logics CK and CK"I"d.