DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 1997; 248 pp; hardcover Volume: 31 ISBN10: 0821805177 ISBN13: 9780821805176 List Price: US$67 Member Price: US$53.60 Order Code: DIMACS/31
 "We hope that this small volume will suggest directions of synergy and contact for future researchers to build upon, creating connections and making discoveries that will help explain some of the many mysteries of computation." from the Preface Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This area has been developing through continuous interaction with computational complexity, database theory, and combinatorics. The volume presents articles by leading researchers who delivered talks at the "Workshop on Finite Models and Descriptive Complexity" at Princeton in January 1996 during a DIMACSsponsored Special Year on Logic and Algorithms. Each article is selfcontained and provides a valuable introduction to the featured research areas connected with finite model theory. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Table of Contents  R. Fagin  Easier ways to win logical games
 B. Courcelle  On the expression of graph properties in some fragments of monadic secondorder logic
 H. Straubing  Finite models, automata, and circuit complexity
 V. Vianu  Databases and finitemodel theory
 M. Y. Vardi  Why is modal logic so robustly decidable?
 E. A. Emerson  Model checking and the mucalculus
 T. Pitassi  Algebraic propositional proof systems
