AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Descriptive Complexity and Finite Models
About this Title
Neil Immerman, University of Massachusetts, Amherst, MA and Phokion G. Kolaitis, University of California, Santa Cruz, Santa Cruz, CA, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1997; Volume 31
ISBNs: 978-0-8218-0517-6 (print); 978-1-4704-3989-7 (online)
DOI: https://doi.org/10.1090/dimacs/031
MathSciNet review: MR1451379
MSC: Primary 68-06; Secondary 03-06, 03C13, 68P15, 68Q15
Table of Contents
Front/Back Matter
Chapters
- 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