Descriptive complexity and finite models : proceedings of a DIMACS workshop, January 14-17, 1996, Princeton University / Neil Immerman, Phokion G. Kolaitis, editor.

Other author Immerman, Neil, 1953-
Other author Kolaitis, Phokion.
Other author DIMACS Workshop on Descriptive Complexity and Finite Models (1996 : Princeton University)
Format Book
Publication InfoProvidence, R.I. : American Mathematical Society, ©1997.
Descriptionxiv, 248 pages : illustrations ; 26 cm.
Subjects
Computational complexity--Congresses.
Model theory--Congresses.

SeriesDIMACS series in discrete mathematics and theoretical computer science ; v. 31
DIMACS series in discrete mathematics and theoretical computer science ; v. 31. ^A467230
Contents Easier ways to win logical games / Ronald Fagin -- On the expression of graph properties in some fragments of monadic second-order logic / Bruno Courcelle -- Finite models, automata, and circuit complexity / Howard Straubing -- Databases and finite-model theory / Victor Vianu -- Why is modal logic so robustly decidable? / Moshe Y. Vardi -- Model checking and the mu-calculus / E. Allen Emerson -- Algebraic propositional proof systems / Toniann Pitassi.
General notePapers presented at DIMACS Workshop on Descriptive Complexity and Finite Models.
General note"NSF science and technology center in discrete mathematics and theoretical computer science a consortium of Rutgers University, Princeton University, AT&T Labs, Bell Labs, and Belcore."
Bibliography noteIncludes bibliographical references (p. 240-244).
LCCN 97000427
ISBN0821805177 (alk. paper)

Availability

Library Location Call Number Status Item Actions
Joyner General Stacks QA267.7 .D47 1997 ✔ Available Place Hold