TY - JOUR
T1 - Coalgebraic semantics of modal logics
T2 - An overview
AU - Kupke, Clemens
AU - Pattinson, Dirk
PY - 2011/9/2
Y1 - 2011/9/2
N2 - Coalgebras can be seen as a natural abstraction of Kripke frames. In the same sense, coalgebraic logics are generalised modal logics. In this paper, we give an overview of the basic tools, techniques and results that connect coalgebras and modal logic. We argue that coalgebras unify the semantics of a large range of different modal logics (such as probabilistic, graded, relational, conditional) and discuss unifying approaches to reasoning at this level of generality. We review languages defined in terms of the so-called cover modality, languages induced by predicate liftings as well as their common categorical abstraction, and present (abstract) results on completeness, expressiveness and complexity in these settings, both for basic languages as well as a number of extensions, such as hybrid languages and fixpoints.
AB - Coalgebras can be seen as a natural abstraction of Kripke frames. In the same sense, coalgebraic logics are generalised modal logics. In this paper, we give an overview of the basic tools, techniques and results that connect coalgebras and modal logic. We argue that coalgebras unify the semantics of a large range of different modal logics (such as probabilistic, graded, relational, conditional) and discuss unifying approaches to reasoning at this level of generality. We review languages defined in terms of the so-called cover modality, languages induced by predicate liftings as well as their common categorical abstraction, and present (abstract) results on completeness, expressiveness and complexity in these settings, both for basic languages as well as a number of extensions, such as hybrid languages and fixpoints.
KW - Coalgebra
KW - Modal logic
UR - http://www.scopus.com/inward/record.url?scp=79961166775&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2011.04.023
DO - 10.1016/j.tcs.2011.04.023
M3 - Article
SN - 0304-3975
VL - 412
SP - 5070
EP - 5094
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 38
ER -