Comonadic semantics for hybrid logic and bounded fragments

In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension of basic modal logic, which corresponds to the bounded fragment of first-order logic. In addition to characterising the various resource-indexed equivalences induced by Hybrid logic and the bounded fragment, and the associated combinatorial decompositions of structures, we also give model-theoretic characterisations of bounded formulas in terms of invariance under generated substructures, in both the finite and infinite cases. 2012 ACM Subject Classification Theory of computation → Modal and temporal logics

[1]  Y. Gurevich.  On Finite Model Theory , 1990 .

[2]  Samson Abramsky,et al.  Relating Structure and Power: Comonadic Semantics for Computational Resources , 2018, CSL.

[3]  V. E. Cazanescu.  Algebraic theories , 2004 .

[4]  Johan van Benthem.  Guards, Bounds, and Generalized Semantics , 2005, J. Log. Lang. Inf..

[5]  Thorsten Altenkirch,et al.  Monads need not be endofunctors , 2010, Log. Methods Comput. Sci..

[6]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[7]  Pengming Wang,et al.  The pebbling comonad in Finite Model Theory , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[8]  Erich Grädel,et al.  Why are Modal Logics so Robustly Decidable? , 2001, Bull. EATCS.

[9]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[10]  Leonid Libkin,et al.  Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series) , 2004 .

[11]  Maarten Marx,et al.  Hybrid logics: characterization, interpolation and complexity , 2001, Journal of Symbolic Logic.

[12]  Patrick Blackburn,et al.  Representation, Reasoning, and Relational Structures: a Hybrid Logic Manifesto , 2000, Log. J. IGPL.

[13]  Samson Abramsky,et al.  Arboreal Categories and Resources , 2021, ICALP.

[14]  T. Braüner.  Hybrid Logic and its Proof-Theory , 2010 .

[15]  J.F.A.K. van Benthem,et al.  Modal logic and classical logic , 1983 .

[16]  Solomon Feferman,et al.  Persistent and invariant formulas relative to theories of higher order , 1966 .

[17]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[18]  A. Levy,et al.  A hierarchy of formulas in set theory , 1965 .

[19]  Phokion G. Kolaitis,et al.  On the expressive power of datalog: tools and a case study , 1990, J. Comput. Syst. Sci..

[20]  B. Dahn.  Admissible sets and structures , 1978 .

[21]  Solomon Feferman,et al.  Persistent and invariant formulas for outer extensions , 1968 .

[22]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[23]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[24]  Samson Abramsky,et al.  Comonadic semantics for guarded fragments , 2020, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[25]  Jaroslav Nesetril,et al.  Tree-depth, subgraph coloring and homomorphism bounds , 2006, Eur. J. Comb..

[26]  Lauri Hella.  Logical Hierarchies in PTIME , 1996, Inf. Comput..

[27]  H. Gaifman.  On Local and Non-Local Properties , 1982 .

[28]  Eric Rosen,et al.  Modal Logic over Finite Structures , 1997, J. Log. Lang. Inf..