Moss' logic for ordered coalgebras
Abstract
We present a finitary version of Moss' coalgebraic logic for -coalgebras, where 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 , and the semantics of the modality is given by relation lifting. For the semantics to work, is required to preserve exact squares. For the finitary setting to work, is required to preserve finite intersections. We develop a notion of a base for subobjects of . 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}
}