10 citations · 37 across the 29 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.LO2014★ 1 cited
Decidable fragments of the Simple Theory of Types with Infinity and NF
Anuj Dawar, Thomas Forster, Zachiri McKenzie
We identify complete fragments of the Simple Theory of Types with Infinity () and Quine's set theory. We show that decides every senten…
cs.DS2014
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
Jannis Bulian, Anuj Dawar
A commonly studied means of parameterizing graph problems is the deletion distance from triviality (Guo et al. 2004), which counts vertices that need to be deleted from a graph to…
cs.CC2014
On Symmetric Circuits and Fixed-Point Logics
Matthew Anderson, Anuj Dawar
We study properties of relational structures such as graphs that are decided by families of Boolean circuits. Circuits that decide such properties are necessarily invariant to perm…