Specifying Coalgebras with Modal Logic
Alexander Kurz · Electronic Notes in Theoretical Computer Science · 1998
We propose to use modal logic as a logic for coalgebras and discuss it in view of the work done on coalgebras as a semantics of object-oriented programming. Two approaches are taken: First, standard concepts of modal logic are applied to coalgebras. For a certain kind of functor it is shown that the logic exactly captures the notion of bisimulation and a complete calculus is given. Second, we discuss the relationship of this approach with the coalgebraic logic of Moss [6].