English

Moss' logic for ordered coalgebras

Logic in Computer Science 2023-06-22 v5

Abstract

We present a finitary version of Moss' coalgebraic logic for TT-coalgebras, where TT 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ωT_\omega^\partial, and the semantics of the modality is given by relation lifting. For the semantics to work, TT is required to preserve exact squares. For the finitary setting to work, TωT_\omega^\partial is required to preserve finite intersections. We develop a notion of a base for subobjects of TωXT_\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.

Keywords

Cite

@article{arxiv.1901.06547,
  title  = {Moss' logic for ordered coalgebras},
  author = {Marta Bílková and Matěj Dostál},
  journal= {arXiv preprint arXiv:1901.06547},
  year   = {2023}
}
R2 v1 2026-06-23T07:16:38.781Z