Thesis icon

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


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author

Contributors

Role:
Supervisor
ORCID:
0000-0003-3921-6637
Role:
Supervisor


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

Terms of use



Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP