Bisimulation through probabilistic testing
Information and Computation
Reasoning about knowledge and probability
Journal of the ACM (JACM)
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Theoretical Computer Science
A compositional approach to defining logics for coalgebras
Theoretical Computer Science - Selected papers of CMCS'03
Theoretical Computer Science - Selected papers of CMCS'03
PSPACE Bounds for Rank-1 Modal Logics
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
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
Presenting functors by operations and equations
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Duality for logics of transition systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Free Heyting algebras: revisited
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
Mathematical Structures in Computer Science
Cut elimination for shallow modal logics
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Some sahlqvist completeness results for coalgebraic logics
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
The Logic of Exact Covers: Completeness and Uniform Interpolation
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
Coalgebras provide a uniform framework for the semantics of a large class of (mostly non-normal) modal logics, including e.g. monotone modal logic, probabilistic and graded modal logic, and coalition logic, as well as the usual Kripke semantics of modal logic. In earlier work, the finite model property for coalgebraic logics has been established w.r.t. the class of all structures appropriate for a given logic at hand; the corresponding modal logics are characterised by being axiomatised in rank 1, i.e. without nested modalities. Here, we extend the range of coalgebraic techniques to cover logics that impose global properties on their models, formulated as frame conditions with possibly nested modalities on the logical side (in generalisation of frame conditions such as symmetry or transitivity in the context of Kripke frames). We show that the finite model property for such logics follows from the finite algebra property of the associated class of complex algebras, and then investigate sufficient conditions for the finite algebra property to hold. Example applications include extensions of coalition logic and logics of uncertainty and knowledge.