2 citations · 6 across the 9 of their papers we have counts for
9 papers
Complexity of Satisfiability in Kochen-Specker Partial Boolean Algebras
Anuj Dawar, Nihil Shah
The Kochen-Specker no-go theorem established that hidden-variable theories in quantum mechanics necessarily admit contextuality. This theorem is formally stated in terms of the par…
A categorical account of composition methods in logic (extended version)
Tomáš Jakl, Dan Marsden, Nihil Shah
We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of sim…
A categorical account of composition methods in logic
Tomáš Jakl, Dan Marsden, Nihil Shah
We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of sim…
Linear Arboreal Categories
Samson Abramsky, Yoàv Montacute, Nihil Shah
Arboreal categories, introduced by Abramsky and Reggio, axiomatise categories with tree-shaped objects. These categories provide a categorical language for formalising behavioural…
A game comonadic account of Courcelle and Feferman-Vaught-Mostowski theorems
Tomáš Jakl, Dan Marsden, Nihil Shah
Game comonads, introduced by Abramsky, Dawar and Wang, and developed by Abramsky and Shah, give a categorical semantics for model comparison games. We present an axiomatic account…
Generalizations of Bilinear Maps -- Technical Report
Tomáš Jakl, Dan Marsden, Nihil Shah
Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result…
The Pebble-Relation Comonad in Finite Model Theory
Yoàv Montacute, Nihil Shah
The pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a categorical interpretation for the k-pebble games from finite model theory. The coKleisli category of the p…
Relating Structure and Power: Extended Version
Samson Abramsky, Nihil Shah
Combinatorial games are widely used in finite model theory, constraint satisfaction, modal logic and concurrency theory to characterize logical equivalences between structures. In…
Relating Structure and Power: Comonadic Semantics for Computational Resources
Samson Abramsky, Nihil Shah
Combinatorial games are widely used in finite model theory, constraint satisfaction, modal logic and concurrency theory to characterize logical equivalences between structures. In…