Descriptive Complexity and Finite Models 1996:
Princeton University
Neil Immerman, Phokion G. Kolaitis (Eds.):
Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop, January 14-17, 1996, Princeton University.
DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31 American Mathematical Society 1996, ISBN 0-8218-0517-7
Ronald Fagin: Easier Ways to Win Logical Games.
1-32
Bruno Courcelle: On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic.
33-62
Howard Straubing: Finite Models, Automata, and Circuit Complexity.
63-96
Victor Vianu: Databases and Finite-Model Theory.
97-148
Moshe Y. Vardi: Why is Modal Logic So Robustly Decidable?
149-184
data released under the ODC-BY 1.0 license
