Affiliation:
1. Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, Oxford OX1 3QD, UK
Abstract
Abstract
Combinatorial games are widely used in finite model theory, constraint satisfaction, modal logic and concurrency theory to characterize logical equivalences between structures. In particular, Ehrenfeucht–Fraïssé games, pebble games and bisimulation games play a central role. We show how each of these types of games can be described in terms of an indexed family of comonads on the category of relational structures and homomorphisms. The index $k$ is a resource parameter that bounds the degree of access to the underlying structure. The coKleisli categories for these comonads can be used to give syntax-free characterizations of a wide range of important logical equivalences. Moreover, the coalgebras for these indexed comonads can be used to characterize key combinatorial parameters: tree depth for the Ehrenfeucht–Fraïssé comonad, tree width for the pebbling comonad and synchronization tree depth for the modal unfolding comonad. These results pave the way for systematic connections between two major branches of the field of logic in computer science, which hitherto have been almost disjoint: categorical semantics and finite and algorithmic model theory.
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference49 articles.
1. Whither semantics;Abramsky;Theoretical Computer Science,2020
2. The quantum monad on relational structures;Abramsky,2018
3. The pebbling comonad in finite model theory;Abramsky,2017
4. Comonadic semantics for guarded fragments;Abramsky,2021
5. Relating structure and power: comonadic semantics for computational resources;Abramsky,2018
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Monoidal Width;Logical Methods in Computer Science;2023-09-04
2. Arboreal Categories: An Axiomatic Theory of Resources;Logical Methods in Computer Science;2023-08-10
3. A categorical account of composition methods in logic;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
4. Structure and Power: an Emerging Landscape;Fundamenta Informaticae;2022-08-30
5. The Pebble-Relation Comonad in Finite Model Theory;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02