Hostname: page-component-857557d7f7-9f75d Total loading time: 0 Render date: 2025-11-20T08:22:52.398Z Has data issue: false hasContentIssue false
  • English
  • Français

A MODULAR BISIMULATION CHARACTERISATION FOR FRAGMENTS OF HYBRID LOGIC

Part of: Theory of computing Model theory General logic

Published online by Cambridge University Press:  03 March 2025

GUILLERMO BADIA Open the ORCID record for GUILLERMO BADIA [Opens in a new window] ,
DANIEL GĂINĂ Open the ORCID record for DANIEL GĂINĂ [Opens in a new window] ,
ALEXANDER KNAPP ,
TOMASZ KOWALSKI Open the ORCID record for TOMASZ KOWALSKI [Opens in a new window]  and
MARTIN WIRSING
GUILLERMO BADIA*
Affiliation:
SCHOOL OF HISTORICAL AND PHILOSOPHICAL INQUIRY UNIVERSITY OF QUEENSLAND BRISBANE, QLD, AUSTRALIA
DANIEL GĂINĂ
Affiliation:
INSTITUTE OF MATHEMATICS FOR INDUSTRY KYUSHU UNIVERSITY FUKUOKA, JAPAN E-mail: daniel@imi.kyushu-u.ac.jp
ALEXANDER KNAPP
Affiliation:
INSTITUTE OF COMPUTER SCIENCE UNIVERSITY OF AUGSBURG AUGSBURG, GERMANY E-mail: knapp@informatik.uni-augsburg.de
TOMASZ KOWALSKI
Affiliation:
DEPARTMENT OF LOGIC, INSTITUTE OF PHILOSOPHY JAGIELLONIAN UNIVERSITY KRAKÓW, POLAND SCHOOL OF MATHEMATICAL AND PHYSICAL SCIENCES LA TROBE UNIVERSITY, MELBOURNE VIC, AUSTRALIA and SCHOOL OF HISTORICAL AND PHILOSOPHICAL INQUIRY UNIVERSITY OF QUEENSLAND BRISBANE, QLD, AUSTRALIA E-mail: tomasz.s.kowalski@uj.edu.pl
MARTIN WIRSING
Affiliation:
DEPARTMENT OF COMPUTER SCIENCE LUDWIG-MAXIMILIANS-UNIVERSITY MUNICH MUNICH, GERMANY E-mail: wirsing@lmu.de
*
E-mail: g.badia@uq.edu.au
Get access Rights & Permissions [Opens in a new window]

Abstract

There are known characterisations of several fragments of hybrid logic by means of invariance under bisimulations of some kind. The fragments include $\{\mathord {\downarrow }, \mathord {@}\}$ with or without nominals (Areces, Blackburn, Marx), $\mathord {@}$ with or without nominals (ten Cate), and $\mathord {\downarrow }$ without nominals (Hodkinson, Tahiri). Some pairs of these characterisations, however, are incompatible with one another. For other fragments of hybrid logic no such characterisations were known so far. We prove a generic bisimulation characterisation theorem for all standard fragments of hybrid logic, in particular for the case with $\mathord {\downarrow }$ and nominals, left open by Hodkinson and Tahiri. Our characterisation is built on a common base and for each feature extension adds a specific condition, so it is modular in an engineering sense.

Keywords

hybrid logicbisimulationsvan Benthem characterisation

MSC classification

Primary: 03B45: Modal logic (including the logic of norms) 03C07: Basic properties of first-order languages and structures 68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Information

Type
Article
Information
Bulletin of Symbolic Logic , First View , pp. 1 - 29
Check for updates
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Aceto, L., Ingólfsdóttir, A., Larsen, K. G., and Srba, J., Reactive Systems: Modelling, Specification and Verification , Cambridge University Press, Cambridge, 2007.Google Scholar
Areces, C., Blackburn, P., and Marx, M., Hybrid logics: Characterization, interpolation and complexity . Journal of Symbolic Logic , vol. 66 (2001), no. 3, pp. 977–1010.Google Scholar
Baader, F. and Nipkow, T., Term Rewriting and All That , Cambridge University Press, New York, 1998.Google Scholar
Badia, G., Bi-simulating in bi-intuitionistic logic . Studia Logica , vol. 104 (2016), no. 5, pp. 1037–1050.Google Scholar
Badia, G., Găină, D., Knapp, A., Kowalski, T., and Wirsing, M., Hybrid-dynamic ehrenfeucht-fraïssé games. CoRR , vol. abs/2406.02094 (2024). https://doi.org/10.48550/arXiv.2406.02094 Google Scholar
Blackburn, P. and Prior, A., Hybrid logic . Synthese , vol. 150 (2006), no. 3, pp. 329–372.Google Scholar
Blackburn, P., de Rijke, M., and Venema, Y., Modal Logic , Cambridge Tracts in Theoretical Computer Science, 53, Cambridge University Press, Cambridge, 2001.Google Scholar
Blackburn, P. and Seligman, J., What are hybrid languages? Advances in Modal Logic , vol. 1, (M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors), CSLI Lecture Notes, 87, CSLI Publications, Stanford, 1998, pp. 41–62.Google Scholar
Blackburn, P. and Tzakova, M., Hybridizing concept languages . Annals of Mathematics and Artificial Intelligence , vol. 24 (1998), nos. 1–4, pp. 23–49.Google Scholar
Braüner, T., Hybrid Logic and its Proof-Theory , Applied Logic Series, 37, Springer, Dordrecht, New York, 2011.Google Scholar
Casanovas, E., Dellunde, P., and Jansana, R., On elementary equivalence for equality-free logic . Notre Dame Journal of Formal Logic , vol. 37 (1996), no. 3, pp. 506–522.Google Scholar
Franceschet, M. and de Rijke, M., Model checking hybrid logics (with an application to semistructured data) . Journal of Applied Physics , vol. 4 (2006), no. 3, pp. 279–304.Google Scholar
Goranko, V. and Otto, M., Model theory of modal logic , Handbook of Modal Logic (P. Blackburn, J. F. A. K. van Benthem, and F. Wolter, editors), Studies in Logic and Practical Reasoning, 3, Elsevier, Amsterdam, 2007, pp. 249–329.Google Scholar
Găină, D., Forcing and calculi for hybrid logics . Journal of the Association for Computing Machinery , vol. 67 (2020), no. 4, pp. 25:1–25:55.Google Scholar
Găină, D., Badia, G., and Kowalski, T., Robinson consistency in many-sorted hybrid first-order logics , Advances in Modal Logic, AiML 2022, Rennes, France, August 22-25, 2022 (D. Fernández-Duque, A. Palmigiano, and S. Pinchinat, editors), College Publications, London, 2022, pp. 407–428.Google Scholar
Găină, D., Badia, G., and Kowalski, T., Omitting types theorem in hybrid dynamic first-order logic with rigid symbols . Annals of Pure and Applied Logic , vol. 174 (2023), no. 3, p. 103212.Google Scholar
Hennicker, R., Knapp, A., and Madeira, A., Hybrid dynamic logic institutions for event/data-based systems . Formal Aspects of Computing , vol. 33 (2021), no. 6, pp. 1209–1248.Google Scholar
Hodges, W., Model Theory , Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge, 1993.Google Scholar
Hodkinson, I., Characterisations of two basic hybrid logics. Manuscript, Imperial College London, London, 2024.Google Scholar
Hodkinson, I. and Tahiri, H., A bisimulation characterization theorem for hybrid logic with the current-state binder . Review of Symbolic Logic , vol. 3 (2010), no. 2, pp. 247–261.Google Scholar
Lindström, P., On extensions of elementary logic . Theoria , vol. 35 (1969), pp. 1–11.Google Scholar
Madeira, A., Barbosa, L. S., Hennicker, R., and Martins, M. A., A logic for the stepwise development of reactive systems . Theoretical Computer Science , vol. 744 (2018), pp. 78–96.Google Scholar
Marker, D., Model theory: An introduction , Graduate Texts in Mathematics, 217, Springer, New York, 2002.Google Scholar
Otto, M., Bisimulation invariance and finite models , Logic Colloquium ’02 , (Z. Chatzidakis, P. Koepke, and W. Pohlers, editors) Lecture Notes in Logic, 27, Cambridge University Press, Cambridge, 2006, pp. 276–298.Google Scholar
Rosen, E., Modal logic over finite structures . Journal of Logic, Language and Information , vol. 6 (1997), no. 4, pp. 427–439.Google Scholar
Rosenberger, T., Knapp, A., and Roggenbach, M., An institutional approach to communicating UML state machines , Proceeding of 25 th International Conference Fundamental Approaches to Software Engineering (FASE) (E. B. Johnsen and M. Wimmer, editors), Lecture Notes in Computer Science, 13241, Springer, Berlin, Heidelberg, 2022, pp. 205–224.Google Scholar
ten Cate, B., Model theory for extended modal languages , Ph.D. thesis, University of Amsterdam, 2005.Google Scholar
van Benthem, J., Modal Logic and Classical Logic , Indices: Monographs in Philosophical Logic and Formal Linguistics, 3, Bibliopolis, Naples, 1985.Google Scholar
van Benthem, J., Exploring Logical Dynamics , Studies in Logic, Language and Information, CSLI Publications, FoLLI: European Association for Logic, Language and Information, Stanford, 1996.Google Scholar
van Benthem, J., A new modal Lindström theorem . Logica Universalis , vol. 1 (2007), no. 1, pp. 125–138.Google Scholar
van Benthem, J., ten Cate, B., and Väänänen, J., Lindström theorems for fragments of first-order logic . Logical Methods in Computer Science , vol. 5 (2009), no. 3, 3:3, 27.Google Scholar