Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2304.12709 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913676944998400 |
|---|---|
| author | Reggio, Luca Riba, Colin |
| author_facet | Reggio, Luca Riba, Colin |
| contents | Arboreal categories provide an axiomatic framework in which abstract notions of bisimilarity and back-and-forth games can be defined. They act on extensional categories, typically consisting of relational structures, via arboreal adjunctions. In many cases, equivalence of structures in fragments of infinitary first-order logic can be captured by transferring the bisimilarity relation along the adjunction.
In most applications, the categories involved are locally finitely presentable and the adjunctions are finitely accessible. Our main result identifies the expressive power of this class of adjunctions. We show that the ranks of back-and-forth games in the arboreal category are definable by formulae à la Hintikka, and thus the relation between extensional objects induced by bisimilarity is always coarser than equivalence in infinitary first-order logic.
Our approach leverages Gabriel-Ulmer duality for locally finitely presentable categories, and Hodges' word-constructions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_12709 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Finitely accessible arboreal adjunctions and Hintikka formulae Reggio, Luca Riba, Colin Logic in Computer Science Arboreal categories provide an axiomatic framework in which abstract notions of bisimilarity and back-and-forth games can be defined. They act on extensional categories, typically consisting of relational structures, via arboreal adjunctions. In many cases, equivalence of structures in fragments of infinitary first-order logic can be captured by transferring the bisimilarity relation along the adjunction. In most applications, the categories involved are locally finitely presentable and the adjunctions are finitely accessible. Our main result identifies the expressive power of this class of adjunctions. We show that the ranks of back-and-forth games in the arboreal category are definable by formulae à la Hintikka, and thus the relation between extensional objects induced by bisimilarity is always coarser than equivalence in infinitary first-order logic. Our approach leverages Gabriel-Ulmer duality for locally finitely presentable categories, and Hodges' word-constructions. |
| title | Finitely accessible arboreal adjunctions and Hintikka formulae |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2304.12709 |