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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Ghilardi, S., Tinelli, C.: A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. Information and Computation 204(10), 1413–1452 (2006)
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2001)
Chellas, B.: Modal Logic, Cambridge (1980)
Cirstea, C., Pattinson, D.: Modular proof systems for coalgebraic logics. Theoret. Comput. Sci. 388, 83–108 (2007)
Došen, K.: Duality between modal algebras and neighbourhood frames. Studia Logica 48(2), 219–234 (1989)
Fagin, R., Halpern, J.: Reasoning about knowledge and probability. J. ACM 41, 340–367 (1994)
Fajardo, R., Finger, M.: How not to combine modal logics. In: Prasad, B. (ed.) IICAI, pp. 1629–1647 (2005)
Fine, K., Schurz, G.: Transfer theorems for stratified modal logics. In: Copeland, J. (ed.) Logic and Reality, Essats in Pure and Applied Logic. In Memory of Arthur Prior, pp. 169–213. Oxford Univeristy Press, Oxford (1996)
Gabbay, D.M., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: Theory and Applications. Elsevier, Amsterdam (2003)
Gumm, H.P.: From T-coalgebras to filter structures and transition systems. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 194–212. Springer, Heidelberg (2005)
Kracht, M., Wolter, F.: Properties of independently axiomatizable bimodal logics. J. Symb. Logic 56(4), 1469–1485 (1991)
Kupke, C., Kurz, A., Venema, Y.: Stone coalgebras. Theor. Comput. Sci. 327(1-2), 109–134 (2004)
Kurucz, A.: Combining modal logics. In: Patrick Blackburn, J.V.B., Wolter, F. (eds.) Handbook of Modal Logic. Studies in Logic and Practical Reasoning, vol. 3, pp. 869–924. Elsevier, Amsterdam (2007)
Schröder, L., Pattinson, D.: Rank-1 logics are coalgebraic. Journal of Logic and Computation 20(5), 1113–1147 (2010)
Schröder, L., Pattinson, D.: Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra. Math. Struct. Comput. Sci. 21 (2011)
Schröder, L.: Expressivity of coalgebraic modal logic: The limits and beyond. Theor. Comput. Sci. 390(2-3), 230–247 (2008)
Wolter, F.: Fusions of modal logics revisited. In: Kracht, M., de Rijke, M., Wansing, H., Zakharyaschev, M. (eds.) Advances in Modal Logic 1096. CSLI Lecture Notes, pp. 361–379. CSLI Publications, Stanford (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dahlqvist, F., Pattinson, D. (2011). On the Fusion of Coalgebraic Logics. In: Corradini, A., Klin, B., Cîrstea, C. (eds) Algebra and Coalgebra in Computer Science. CALCO 2011. Lecture Notes in Computer Science, vol 6859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22944-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-22944-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22943-5
Online ISBN: 978-3-642-22944-2
eBook Packages: Computer ScienceComputer Science (R0)