8 citations · 26 across the 13 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.LO2020
First-order axiomatisations of representable relation algebras need formulas of unbounded quantifier depth
Rob Egrot, Robin Hirsch
Using a variation of the rainbow construction and various pebble and colouring games, we prove that RRA, the class of all representable relation algebras, cannot be axiomatised by…
math.CO2020★ 2 cited
Seurat games on Stockmeyer graphs
Rob Egrot, Robin Hirsch
We define a family of vertex colouring games played over a pair of graphs or digraphs by players and . These games arise from work on a longstanding open…