Similar Items: Constant time testability of first-order logic with modulo counting on finitary graphs
- A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers
- Order-invariant cluster first-order logic on graph classes of bounded degree
- Finitary Truly Concurrent Bisimulations
- Automaton-based Characterisations of First Order Logic over Infinite Trees
- Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
- An Effective Orchestral Approach to Satisfiability Modulo Prime Fields