Moss' logic for ordered coalgebras
-
Published:2022-08-09
Issue:
Volume:Volume 18, Issue 3
Page:
-
ISSN:1860-5974
-
Container-title:Logical Methods in Computer Science
-
language:en
-
Short-container-title:
Author:
Bílková Marta,Dostál Matěj
Abstract
We present a finitary version of Moss' coalgebraic logic for $T$-coalgebras,
where $T$ is a locally monotone endofunctor of the category of posets and
monotone maps. The logic uses a single cover modality whose arity is given by
the least finitary subfunctor of the dual of the coalgebra functor
$T_\omega^\partial$, and the semantics of the modality is given by relation
lifting. For the semantics to work, $T$ is required to preserve exact squares.
For the finitary setting to work, $T_\omega^\partial$ is required to preserve
finite intersections. We develop a notion of a base for subobjects of $T_\omega
X$. This in particular allows us to talk about the finite poset of subformulas
for a given formula. The notion of a base is introduced generally for a
category equipped with a suitable factorisation system.
We prove that the resulting logic has the Hennessy-Milner property for the
notion of similarity based on the notion of relation lifting. We define a
sequent proof system for the logic, and prove its completeness.
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science