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

Contributor(s):

Series: DIMACS series in discrete mathematics and theoretical computer science ; v. 31Publication details: Providence, R.I.: American Mathematical Society, c1997.Description: xiv, 248 p.: ill.; 26 cmISBN:

0821805177 (alk. paper)

Subject(s):

DDC classification:

511.3 D449

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 .

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Date due	Barcode
Books	Castorina Estantes Abertas (Open Shelves)	Livros (Books)	511.3 D449 1997 IMPA (Browse shelf(Opens below))	1	Available		39063000164080

Papers presented at DIMACS Workshop on Descriptive Complexity and Finite Models.

"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."

Includes bibliographical references (p. 240-244).

There are no comments on this title.

to post a comment.