Arboreal Categories: An Axiomatic Theory of Resources

02/16/2021
by   Samson Abramsky, et al.
0

We introduce arboreal categories, which have an intrinsic process structure, allowing dynamic notions such as bisimulation and back-and-forth games, and resource notions such as number of rounds of a game, to be defined. These are related to extensional or "static" structures via arboreal covers, which are resource-indexed comonadic adjunctions. These ideas are developed in a very general, axiomatic setting, and applied to relational structures, where the recently introduced comonadic constructions for pebbling, Ehrenfeucht-Fraïssé and modal bisimulation games are recovered, showing that many of the fundamental notions of finite model theory and descriptive complexity arise from instances of arboreal covers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2019

On Games and Computation

We introduce and investigate a range of general notions of a game. Our p...
research
09/02/2022

Notions of parametricity as monoidal models for type theory

This article gives a solid theoretical grounding to the observation that...
research
04/25/2023

Finitely accessible arboreal adjunctions and Hintikka formulae

Arboreal categories provide an axiomatic framework in which abstract not...
research
06/15/2022

Structure and Power: an emerging landscape

In this paper, we give an overview of some recent work on applying tools...
research
07/22/2019

Codensity Games for Bisimilarity

Bisimilarity as an equivalence notion of systems has been central to pro...
research
07/11/2018

Relating Idioms, Arrows and Monads from Monoidal Adjunctions

We revisit once again the connection between three notions of computatio...
research
05/11/2020

The Safari of Update Structures: Visiting the Lens and Quantum Enclosures

We build upon our recently introduced concept of an update structure to ...

Please sign up or login with your details

Forgot password? Click here to reset