Similar Items: On the locality of arb-invariant first-order formulas with modulo counting quantifiers
- Tree-width for first order formulae
- Subspace-Invariant AC$^0$ Formulas
- Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
- A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers
- Successor-Invariant First-Order Logic on Classes of Bounded Degree
- Bounded Quantifier Instantiation for Checking Inductive Invariants