Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop, January 14-17, 1996, Princeton University - researchr publication

researchr

You are not signed in
Sign in
Sign up

Neil Immerman, Phokion G. Kolaitis, editors, Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop, January 14-17, 1996, Princeton University. Volume 31 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1996.

Conference: dimacs1996

Abstract is missing.

Easier Ways to Win Logical GamesRonald Fagin. 1-32

On the Expression of Graph Properties in some Fragments of Monadic Second-Order LogicBruno Courcelle. 33-62

Finite Models, Automata, and Circuit ComplexityHoward Straubing. 63-96

Databases and Finite-Model TheoryVictor Vianu. 97-148

Why is Modal Logic So Robustly Decidable?Moshe Y. Vardi. 149-184

Model Checking and the Mu-calculusE. Allen Emerson. 185-214

Algebraic Propositional Proof SystemsToniann Pitassi. 215-244

runs on WebDSL