Comonadic semantics for guarded fragments

@article{Abramsky2021ComonadicSF,
  title={Comonadic semantics for guarded fragments},
  author={Samson Abramsky and Dan Marsden},
  journal={2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
  year={2021},
  pages={1-13}
}
  • S. Abramsky, Dan Marsden
  • Published 2021
  • Computer Science, Mathematics
  • 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
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-width and tree-depth.The present paper extends this analysis to quantifier-guarded fragments of… Expand
Relating Structure and Power: Comonadic Semantics for Computational Resources
TLDR
The results pave the way for systematic connections between two major branches of the field of logic in computer science which hitherto have been almost disjoint: categorical semantics, and finite and algorithmic model theory. Expand
Relating structure and power: Comonadic semantics for computational resources
  • S. Abramsky, Nihil Shah
  • Computer Science
  • J. Log. Comput.
  • 2021
TLDR
The results pave the way for systematic connections between two major branches of the field of logic in computer science, which hitherto have been almost disjoint: categorical semantics and finite and algorithmic model theory. Expand
Arboreal Categories and 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 aExpand
The Pebble-Relation Comonad in Finite Model Theory
TLDR
This paper introduces the pebble-relation comonad that characterises pathwidth and whose coalgebras correspond to path decompositions and proves a new Lovász-type theorem relating pathwidth to the restricted conjunction fragment of k-variable logic with counting quantifiers using a recently developed categorical generalisation. Expand
Comonadic semantics for hybrid logic and bounded fragments
TLDR
This work characterises the various resource-indexed equivalences induced by Hybrid logic and the bounded fragment, and the associated combinatorial decompositions of structures, and gives model-theoretic characterisations of bounded formulas in terms of invariance under generated substructures, in both the finite and infinite cases. Expand
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 aExpand
Lovász-Type Theorems and Game Comonads
TLDR
This work proposes a new categorical formulation, which applies to any locally finite category with pushouts and a proper factorisation system, and presents a novel application to homomorphism counts in modal logic. Expand
Relating Structure and Power: Extended Version
TLDR
The results pave the way for systematic connections between two major branches of the field of logic in computer science which hitherto have been almost disjoint: categorical semantics, and finite and algorithmic model theory. Expand

References

SHOWING 1-10 OF 23 REFERENCES
Relating Structure and Power: Comonadic Semantics for Computational Resources
TLDR
The results pave the way for systematic connections between two major branches of the field of logic in computer science which hitherto have been almost disjoint: categorical semantics, and finite and algorithmic model theory. Expand
The Complexity of Boundedness for Guarded Logics
TLDR
It is proved that bounded ness for the guarded negation fragment is decidable in elementary time, and, making use of an unpublished result of Colcombet, even 2EXPTIME-complete. Expand
The pebbling comonad in Finite Model Theory
TLDR
It is shown that existential k-pebble games have a natural comonadic formulation and lays the basis for some new and promising connections between two areas within logic in computer science which have largely been disjoint: finite and algorithmic model theory, and semantics and categorical structures of computation. Expand
Bisimulation and open maps
  • A. Joyal, M. Nielsen, G. Winskel
  • Mathematics, Computer Science
  • [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
  • 1993
TLDR
An abstract definition of bisimulation is presented and a promising new model, presheaf on categories of pomsets, into which the usual category of labeled event structures embeds fully and faithfully is presented. Expand
Decision procedures for guarded logics
Different variants of guarded logics (a powerful generalization of modal logics) are surveyed and the recent decidability result for guarded fixed point logic (obtained in joint work with I.Expand
Queries with Guarded Negation (full version)
TLDR
A fragment of SQL, called GN-SQL, as well as a fragment of Datalog with stratified negation that allow only guarded negation are introduced, and it is shown that these query languages are computationally well behaved, in terms of testing query containment, query evaluation, open-world query answering, and boundedness. Expand
Unary negation fragment with equivalence relations has the finite model property
TLDR
It is shown that every satisfiable formula has a model of at most doubly exponential size and argued that the satisfiability (= finite satisfiability) problem for this logic is 2-ExpTime-complete. Expand
Finite conformal hypergraph covers and Gaifman cliques in finite structures
TLDR
An open question about a clique constrained strengthening of the extension property for partial automorphisms (EPPA) of Hrushovski, Herwig and Lascar is answered and an alternative proof of the finite model property (FMP) for the clique guarded fragment of first-order logic CGF is provided. Expand
Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment
  • Martin Otto
  • Mathematics, Computer Science
  • 2010 25th Annual IEEE Symposium on Logic in Computer Science
  • 2010
TLDR
It is shown that finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class, and only counts transitions between colour classes are useful in the construction of finite bisimilar hypergraph covers. Expand
The Freedoms of Guarded Bisimulation
TLDR
Results to be surveyed include finite and small model properties, decidability results, complexity and expressive completeness issues, and guarded bisimulations. Expand
...
1
2
3
...