Finite and Algorithmic Model Theory (London Mathematical Society Lecture Note Series)

Cambridge University Press, 10/3/2011
EAN 9780521718202, ISBN10: 0521718201

Paperback, 354 pages, 22.6 x 15.3 x 1.8 cm
Language: English

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

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.