We apply methods developed to study coalgebraic logic to investigate expressivity of many-valued modal logics which we consider as coalgebraic languages interpreted over set-coalgebras with many-valued valuations. The languages are based on many-valued predicate liftings. We provide a characterization theorem for a language generated by a set of such modalities to be expressive for bisimilarity: in addition to the usual condition on the set of predicate liftings being separating, we indicate a sufficient and sometimes also necessary condition on the algebra of truth values which guarantees expressivity. Thus, adapting results of Schr¨oder [16] concerning expressivity of boolean coalgebraic logics to many-valued setting, we generalize results of Metcalfe and Martí [13], concerning Hennessy-Milner property for many-valued modal logics based on ⧠ and ◇.
CITATION STYLE
Bílková, M., & Dostál, M. (2016). Expressivity of many-valued modal logics, coalgebraically. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9803 LNCS, pp. 109–124). Springer Verlag. https://doi.org/10.1007/978-3-662-52921-8_8
Mendeley helps you to discover research relevant for your work.