Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Theory of linear and integer programming
Theory of linear and integer programming
Bisimulation through probabilistic testing
Information and Computation
First steps in modal logic
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Specifying coalgebras with modal logic
Theoretical Computer Science
Modal logic
The modal logic of probability
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Semantical Principles in the Modal Logic of Coalgebras
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
Algebraic Semantics for Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Realizations by stochastic finite automata
Journal of Computer and System Sciences
Expressivity of coalgebraic modal logic: the limits and beyond
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Final sequences and final coalgebras for measurable spaces
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
Admissibility of Cut in Coalgebraic Logics
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
Coalgebraic modal logic in COCASL
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Beyond rank 1: algebraic semantics and finite models for coalgebraic logics
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
EXPTIME tableaux for the coalgebraic µ-calculus
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Cut elimination in coalgebraic logics
Information and Computation
Modular algorithms for heterogeneous modal logics
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Some sahlqvist completeness results for coalgebraic logics
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.01 |
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove that (finitary) coalgebraic modal logic has the finite model property. This fact not only reproves known completeness results for coalgebraic modal logic, which we push further by establishing that every coalgebraic modal logic admits a complete axiomatization of rank 1; it also enables us to establish a generic decidability result and a first complexity bound. Examples covered by these general results include, besides standard Hennessy-Milner logic, graded modal logic and probabilistic modal logic.