Strongly complete logics for coalgebras

DOI10.2168/LMCS-8(3:14)2012zbMATH Open1263.03063arXiv1207.2732OpenAlexW2004318671MaRDI QIDQ2914235FDOQ2914235

Alexander Kurz, Jiří Rosický

Publication date: 25 September 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Abstract: Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary set-functor is given and proven to be strongly complete under additional assumptions. We proceed in three parts. Part I argues that sifted colimit preserving functors are those functors that preserve universal algebraic structure. Our main theorem here states that a functor preserves sifted colimits if and only if it has a finitary presentation by operations and equations. Moreover, the presentation of the category of algebras for the functor is obtained compositionally from the presentations of the underlying category and of the functor. Part II investigates algebras for a functor over ind-completions and extends the theorem of J{'o}nsson and Tarski on canonical extensions of Boolean algebras with operators to this setting. Part III shows, based on Part I, how to associate a finitary logic to any finite-sets preserving functor T. Based on Part II we prove the logic to be strongly complete under a reasonable condition on T.

Full work available at URL: https://arxiv.org/abs/1207.2732

zbMATH Keywords

coalgebramodal logicalgebraic theoriesStone dualitystrong completenesspresentation of functorssifted colimitsJonsson-Tarski-type theorems

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Categorical logic, topoi (03G30) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Cited In (19)

• Rational operational models
• Coequational logic for finitary functors
• Coalgebraic Modal Logic Beyond Sets
• Some co-Birkhoff type theorems
• Strong Completeness of a Pure Free Logic
• Equational coalgebraic logic
• On a categorical framework for coalgebraic modal logic
• Some Sahlqvist Completeness Results for Coalgebraic Logics
• Many-valued coalgebraic logic over semi-primal varieties
• Flat Coalgebraic Fixed Point Logics
• Smooth coalgebra: testing vector analysis
• A Cook's tour of duality in logic: from quantifiers, through Vietoris, to measures
• A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors
• COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
• Coalgebraic Completeness-via-Canonicity
• Enriched logical connections
• A categorical view of varieties of ordered algebras
• A compositional approach to defining logics for coalgebras
• Coalgebraic Geometric Logic: Basic Theory

Recommendations

• Title not available (Why is that?) 👍 👎
• Coalgebraic logic 👍 👎
• On a categorical framework for coalgebraic modal logic 👍 👎
• Algebraic semantics for coalgebraic logics 👍 👎
• Modalities in the Stone age: a comparison of coalgebraic logics 👍 👎
• Foundations of Software Science and Computation Structures 👍 👎
• Completeness for the coalgebraic cover modality 👍 👎
• Proof systems for Moss' coalgebraic logic 👍 👎
• Equational coalgebraic logic 👍 👎
• Functorial coalgebraic logic: the case of many-sorted varieties 👍 👎

This page was built for publication: Strongly complete logics for coalgebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914235)