Descriptive complexity and finite models : proceedings of a DIMACS workshop, January 14-17, 1996, Princeton University
Neil Immerman, Phokion G. Kolaitis, Finite Models · American Mathematical Society eBooks · 1997
Easier ways to win logical games by R. Fagin On the expression of graph properties in some fragments of monadic second-order logic by B. Courcelle Finite models, automata, and circuit complexity by H. Straubing Databases and finite-model theory by V. Vianu Why is modal logic so robustly decidable? by M. Y. Vardi Model checking and the mu-calculus by E. A. Emerson Algebraic propositional proof systems by T. Pitassi.