On the fusion of coalgebraic logics

Authors:
Fredrik Dahlqvist;Dirk Pattinson
Affiliations:
Dept. of Computing, Imperial College London;Dept. of Computing, Imperial College London
Venue:
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Year:
2011

Citing 10
Cited 0

Properties of independently axiomatizable bimodal logics

Journal of Symbolic Logic
Reasoning about knowledge and probability

Journal of the ACM (JACM)
Modal logic

Modal logic
Stone coalgebras

Theoretical Computer Science - Selected papers of CMCS'03
A new combination procedure for the word problem that generalizes fusion decidability results in modal logics

Information and Computation - Special issue: Combining logical systems
Modular construction of complete coalgebraic logics

Theoretical Computer Science
Expressivity of coalgebraic modal logic: The limits and beyond

Theoretical Computer Science
Rank-1 Modal Logics are Coalgebraic

Journal of Logic and Computation
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra

Mathematical Structures in Computer Science
From T-coalgebras to filter structures and transition systems

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to transfer from the component logics to their fusion. In this paper we investigate to what extent these results can be generalised to the case of arbitrary coalgebraic logics. Our main result generalises a construction of Kracht and Wolter and confirms that completeness transfers to fusion for a large class of logics over coalgebraic semantics. This result is independent of the rank of the logics and relies on generalising the notions of distance and box operator to coalgebraic models.