10 citations · 37 across the 29 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.LO2017★ 2 cited
Logical properties of random graphs from small addable classes
Anuj Dawar, Eryk Kopczyński
We establish zero-one laws and convergence laws for monadic second-order logic (MSO) (and, a fortiori, first-order logic) on a number of interesting graph classes. In particular, w…
cs.LO2017
The pebbling comonad in finite model theory
Samson Abramsky, Anuj Dawar, Pengming Wang
Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction and database theory. Monads and comonads are basic notions of category theory which ar…