Abstract | ||
---|---|---|
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 comonads on the category of relational structures. Moreover, the coalgebras for these comonads capture important combinatorial parameters such as tree... |
Year | DOI | Venue |
---|---|---|
2021 | 10.1109/LICS52264.2021.9470594 | 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) |
Keywords | DocType | ISBN |
Computer science,Systematics,Semantics,Games | Conference | 978-1-6654-4895-6 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Samson Abramsky | 1 | 3169 | 348.51 |
Daniel Marsden | 2 | 26 | 5.81 |