Arboreal Categories: An Axiomatic Theory of Resources

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 comonadic constructions for pebbling, Ehrenfeucht-Fräıssé and modal bisimulation games recently introduced in [2, 5, 6] are recovered, showing that many of the fundamental notions of finite model theory and descriptive complexity arise from instances of arboreal covers.

[1]  G. M. Kelly,et al.  Categories of continuous functors, I , 1972 .

[2]  Samson Abramsky,et al.  Relating structure and power: Comonadic semantics for computational resources , 2021, J. Log. Comput..

[3]  Lovász-Type Theorems and Game Comonads , 2021, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[4]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[5]  Thomas Paine,et al.  A Pebbling Comonad for Finite Rank and Variable Logic, and an Application to the Equirank-variable Homomorphism Preservation Theorem , 2020, MFPS.

[6]  Ton Kloks.  Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.

[7]  Eric Rosen.  Finite model theory and finite variable logics , 1996 .

[8]  Leonid Libkin,et al.  Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series) , 2004 .

[9]  Jirí Adámek,et al.  Abstract and Concrete Categories - The Joy of Cats , 1990 .

[10]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[11]  Benjamin Rossman,et al.  Homomorphism preservation theorems , 2008, JACM.

[12]  Samson Abramsky,et al.  Comonadic semantics for guarded fragments , 2020, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[13]  Jaroslav Nesetril,et al.  Tree-depth, subgraph coloring and homomorphism bounds , 2006, Eur. J. Comb..

[14]  Pengming Wang,et al.  The pebbling comonad in Finite Model Theory , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[15]  Anuj Dawar,et al.  Game Comonads & Generalised Quantifiers , 2021, CSL.

[16]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[17]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[18]  Samson Abramsky,et al.  Relating Structure and Power: Comonadic Semantics for Computational Resources , 2018, CSL.

[19]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[20]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[21]  R. Lyndon.  PROPERTIES PRESERVED UNDER HOMOMORPHISM , 1959 .

[22]  Horst Herrlich,et al.  Abstract and concrete categories , 1990 .

[23]  Samson Abramsky,et al.  Whither semantics? , 2020, Theor. Comput. Sci..

[24]  Luca Reggio,et al.  Polyadic Sets and Homomorphism Counting , 2021, Advances in Mathematics.

[25]  Glynn Winskel,et al.  Bisimulation and open maps , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[26]  J. Adámek,et al.  On Finitary Functors , 2019 .

[27]  E. Riehl,et al.  FACTORIZATION SYSTEMS , 2008 .

[28]  Dominic R. Verity,et al.  ∞-Categories for the Working Mathematician , 2018 .

[29]  George N. Raney,et al.  Completely distributive complete lattices , 1952 .

[30]  A. Tarski.  Contributions to the theory of models. III , 1954 .