num_pages: 248
description: Seven proceedings papers from the January 1996 workshop introducing new research in areas connected with finite model theory as it relates to computational complexity, database theory, and combinatorics. The seven papers feature discussions on easier ways to win logical games, the expression of graph properties in some fragments of monadic second-order logic, finite models, automata, circuit complexity, databases and finite-model theory, modal logic, model checking and the Mu-calculus, and algebraic propositional proof systems. Lacks an index. Annotation c. by Book News, Inc., Portland, Or.
language: English
title: Descriptive Complexity and Finite Models: Proceedings of a Dimacs Workshop January 14-17, 1996 Princeton University
titlecomplete: 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)
publisher: Amer Mathematical Society