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 BibTeX

@proceedings{DBLP:conf/dimacs/1996,
  editor    = {Neil Immerman and
               Phokion G. Kolaitis},
  title     = {Descriptive Complexity and Finite Models, Proceedings of a DIMACS
               Workshop, January 14-17, 1996, Princeton University},
  booktitle = {Descriptive Complexity and Finite Models},
  publisher = {American Mathematical Society},
  series    = {DIMACS Series in Discrete Mathematics and Theoretical Computer
               Science},
  volume    = {31},
  year      = {1996},
  isbn      = {0-8218-0517-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Ronald Fagin: Easier Ways to Win Logical Games. 1-32 BibTeX
Bruno Courcelle: On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic. 33-62 BibTeX
Howard Straubing: Finite Models, Automata, and Circuit Complexity. 63-96 BibTeX
Victor Vianu: Databases and Finite-Model Theory. 97-148 BibTeX
Moshe Y. Vardi: Why is Modal Logic So Robustly Decidable? 149-184 BibTeX
E. Allen Emerson: Model Checking and the Mu-calculus. 185-214 BibTeX
Toniann Pitassi: Algebraic Propositional Proof Systems. 215-244 BibTeX