A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Expressive Logics for Coinductive Predicates
2020
Annual Conference for Computer Science Logic
The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general context, moving from transition systems to coalgebras and from bisimilarity to coinductive predicates. We formulate when a logic fully characterises a coinductive predicate on coalgebras, by providing suitable notions of adequacy and expressivity, and give
doi:10.4230/lipics.csl.2020.26
dblp:conf/csl/KupkeR20
fatcat:fxdsbiiedrgshgqbeyasc7gina