Completeness for the Coalgebraic Cover Modality

Authors

Clemens Kupke, University of Oxford
Alexander Kurz, Chapman UniversityFollow
Yde Venema, Universiteit van Amsterdam

Document Type

Article

Publication Date

2012

Abstract

We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical propositional logic with a so-called coalgebraic cover modality depending on the type functor. Its semantics is defined in terms of a categorically defined relation lifting operation.

As the main contributions of our paper we introduce a derivation system, and prove that it provides a sound and complete axiomatization for the collection of coalgebraically valid inequalities. Our soundness and completeness proof is algebraic, and we employ Pattinson’s stratification method, showing that our derivation system can be stratified in countably many layers, corresponding to the modal depth of the formulas involved.

In the proof of our main result we identify some new concepts and obtain some auxiliary results of independent interest. We survey properties of the notion of relation lifting, induced by an arbitrary but fixed set functor. We introduce a category of Boolean algebra presentations, and establish an adjunction between it and the category of Boolean algebras.

Given the fact that our derivation system involves only formulas of depth one, it can be encoded as a endo-functor on Boolean algebras. We show that this functor is finitary and preserves embeddings, and we prove that the Lindenbaum-Tarski algebra of our logic can be identified with the initial algebra for this functor.

Comments

This article was originally published in Logical Methods in Computer Science, volume 8, issue 3, in 2012. DOI: 10.2168/LMCS-8(3:2)2012

Recommended Citation

C. Kupke, A. Kurz, and Y. Venema, “Completeness for the coalgebraic cover modality,” Logical Methods in Computer Science, vol. 8, no. 3, Jul. 2012. DOI: 10.2168/LMCS-8(3:2)2012

Copyright

The authors

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.