Descriptive complexity and finite models : proceedings of a DIMACS workshop, January 14-17, 1996, Princeton University /

Descriptive complexity and finite models : proceedings of a DIMACS workshop, January 14-17, 1996, Princeton University /

Saved in:

Bibliographic Details
Imprint:	Providence, R.I. : American Mathematical Society, c1997.
Description:	xiv, 248 p. : ill. ; 27 cm.
Language:	English
Series:	DIMACS series in discrete mathematics and theoretical computer science v. 31
Subject:	Computational complexity -- Congresses. Model theory -- Congresses. Computational complexity. Model theory. Conference papers and proceedings.
Format:	Print Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/2677345

Hidden Bibliographic Details
Other authors / contributors:	Immerman, Neil, 1935- Kolaitis, Phokion.
ISBN:	0821805177 (alk. paper)
Notes:	Includes bibliographical references.

Table of Contents:

Easier ways to win logical games
On the expression of graph properties in some fragments of monadic second-order logic
Finite models, automata, and circuit complexity
Databases and finite-model theory
Why is modal logic so robustly decidable?
Model checking and the mu-calculus
Algebraic propositional proof systems