Thesis
Arboreal covers over relational structures
- Abstract:
-
Model comparison games are an important tool in both finite and unrestricted model theory to prove when two structures satisfy the same sentences in a logic. Game comonads encode particular model comparison games as comonads on the categories of structures. This started with the work of Abramsky, Dawar, and Wang in 2017 on encoding pebble games for finite variable logics. Since this initial work, several examples of comonads have been engineered to capture a wide-range of logics relevant ...
Expand abstract
Actions
Authors
+ DeepMind (United Kingdom)
More from this funder
- Funder identifier:
- https://ror.org/00971b260
- Programme:
- Oxford DeepMind Graduate Scholarship/EPSRC Doctoral Training Partnership
- DOI:
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- University of Oxford
- Language:
-
English
- Keywords:
- Subjects:
- Deposit date:
-
2025-05-27
Terms of use
- Copyright holder:
- Nihil Shah
- Copyright date:
- 2024
If you are the owner of this record, you can report an update to it here: Report update to this record