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.

Surveys of current research in logical aspects of computer science that apply finite and infinite model-theoretic methods.

About the Author
Javier Esparza has held the Chair for Foundations of Software Reliability and Theoretical Computer Science at the Technische Universitat Munchen since 2007. Christian Michaux has held the Chair of Mathematical Logic at the University of Mons (UMONS, formerly Universite 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.

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



Book Information
ISBN 9780521718202
Author Javier Esparza
Format Paperback
Page Count 356
Imprint Cambridge University Press
Publisher Cambridge University Press
Weight(grams) 520g
Dimensions(mm) 226mm * 153mm * 18mm