##
###
Positive Fragments of Coalgebraic Logics
[chapter]

Adriana Balan, Alexander Kurz, Jiří Velebil

2013
*
Lecture Notes in Computer Science
*

Positive modal logic was introduced in an influential 1995 paper of Dunn as the positive fragment of standard modal logic. His completeness result consists of an axiomatization that derives all modal formulas that are valid on all Kripke frames and are built only from atomic propositions, conjunction, disjunction, box and diamond. In this paper, we provide a coalgebraic analysis of this theorem, which not only gives a conceptual proof based on duality theory, but also generalizes Dunn's result
## more »

... rom Kripke frames to coalgebras for weak-pullback preserving functors. To facilitate this analysis we prove a number of category theoretic results on functors on the categories Set of sets and Pos of posets: Every functor Set → Pos has a Pos-enriched left Kan extension Pos → Pos. Functors arising in this way are said to have a presentation in discrete arities. In the case that Set → Pos is actually Set-valued, we call the corresponding left Kan extension Pos → Pos its posetification. A set functor preserves weak pullbacks if and only if its posetification preserves exact squares. A Pos-functor with a presentation in discrete arities preserves surjections. The inclusion Set → Pos is dense. A functor Pos → Pos has a presentation in discrete arities if and only if it preserves coinserters of 'truncated nerves of posets'. A functor Pos → Pos is a posetification if and only if it preserves coinserters of truncated nerves of posets and discrete posets. A locally monotone endofunctor of an ordered variety has a presentation by monotone operations and equations if and only if it preserves Pos-enriched sifted colimits. 2012 ACM CCS: [Theory of computation]: Logic. On the algebraic side, the move to Pos-enriched colimits guarantees that the modal operations are monotone. In Section 5, and recalling [43, Theorem 4.7] stating that a functor L ′ : DL → DL preserves ordinary sifted colimits if and only if it has a presentation by operations and equations, we show that L ′ : DL → DL preserves enriched sifted colimits if and only if it has a presentation by monotone operations and equations (Theorem 5.16). To see the relevance of a presentation result specific to monotone operations, observe that in the example of positive modal logic it is indeed the case that both and ♦ are monotone.

doi:10.1007/978-3-642-40206-7_6
fatcat:xmel4tovlfhkll3lax36dmbdxi