Finite and Algorithmic Model Theory

by Javier Esparza, Christian Michaux, Charles Steinhorn

Overview

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.

Product Details

ISBN-13:	9780521718202
Publisher:	Cambridge University Press
Publication date:	03/10/2011
Series:	London Mathematical Society Lecture Note Series , #379
Edition description:	New Edition
Pages:	356
Product dimensions:	6.00(w) x 8.90(h) x 0.80(d)

About the Author

Javier Esparza has held the Chair for Foundations of Software Reliability and Theoretical Computer Science at the Technische Universität München since 2007.

Christian Michaux has held the Chair of Mathematical Logic at the University of Mons (UMONS, formerly Université de Mons-Hainaut) since 2000. He is currently Dean of the Faculty of Sciences.

Charles Steinhorn is Professor of Mathematics at Vassar College, where he has served as Chair of the Mathematics Department and Associate Dean of the Faculty.

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.

Editorial Reviews

"Researchers will find the book useful for referring to theorems on finite model theory. For building models of complicated problems, the book provides a good foundation."
Maulik A. Dave, Computing Reviews

From the Publisher