Skip to main content

Research Repository

Advanced Search

Outputs (5)

A categorical account of composition methods in logic (2023)
Presentation / Conference Contribution
Marsden, D., Shah, N., & Jakl, T. (2023, June). A categorical account of composition methods in logic. Presented at Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Boston, USA

We present a categorical theory of the composition methods in finite model theory – a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the composition method... Read More about A categorical account of composition methods in logic.

Comonadic semantics for hybrid logic (2022)
Presentation / Conference Contribution
Marsden, D., & Abramsky, S. (2022, August). Comonadic semantics for hybrid logic. Presented at 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Vienna, Austria

Hybrid logic is a widely-studied extension of basic modal logic, which corresponds to the bounded fragment of first-order logic. We study it from two novel perspectives: (1) We apply the recently introduced paradigm of comonadic semantics, which prov... Read More about Comonadic semantics for hybrid logic.

No-Go Theorems for Distributive Laws (2022)
Journal Article
Zwart, M., & Marsden, D. (2022). No-Go Theorems for Distributive Laws. Logical Methods in Computer Science, 18(1), https://doi.org/10.46298/LMCS-18%281%3A13%292022

Monads are commonplace in computer science, and can be composed using Beck's distributive laws. Unfortunately, finding distributive laws can be extremely difficult and error-prone. The literature contains some general principles for constructing dist... Read More about No-Go Theorems for Distributive Laws.

Comonadic semantics for guarded fragments (2021)
Presentation / Conference Contribution
Abramsky, S., & Marsden, D. (2021, June). Comonadic semantics for guarded fragments. Presented at 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Rome, Italy

In previous work ([1], [2], [3]), it has been shown how a range of model comparison games which play a central role in finite model theory, including Ehrenfeucht-Fraïssé, pebbling, and bisimulation games, can be captured in terms of resource-indexed... Read More about Comonadic semantics for guarded fragments.