Finite and Algorithmic Model Theory
Finite and Algorithmic Model Theory
Christian Michaux, Université de Mons, Belgium
Charles Steinhorn, Vassar College, New York
NZD$117.95
inc GSTIntended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research.
- Model theoretic methods are applied to hot topics in theoretical computer science
- Provides a gentle, accessible introduction to cutting-edge topics
- Encourages further interaction between the computer science and mathematical logic communities
Product details
March 2011Paperback
9780521718202
356 pages
226 × 153 × 18 mm
0.52kg
55 b/w illus.
Available
Table of Contents
- Preface Javier Esparza, Christian Michaux and Charles Steinhorn
- Automata-based presentations of infinite structures Vince Bárány, Erich Grädel and Sasha Rubin
- Logical aspects of spatial databases Bart Kuijpers and Jan Van den Bussche
- Some connections between finite and infinite model theory Vera Koponen
- Algorithmic meta-theorems Stephan Kreutzer
- Definability in classes of finite structures H. Dugald Macpherson and Charles Steinhorn
- Model theoretic methods for fragments of FO and special classes of (finite) structures Martin Otto.
