Finite and Algorithmic Model Theory

Erscheinungsjahr 2011
ISBN: 978-0-521-71820-2
Verlag: Cambridge University Press

Buch, Englisch, Band 379, 356 Seiten, Format (B × H): 152 mm x 229 mm, Gewicht: 575 g

Reihe: London Mathematical Society Lecture Note Series

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

Autoren/Hrsg.

Esparza, Javier

Michaux, Christian

Steinhorn, Charles

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen

Inhaltsverzeichnis

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.

Über Autor(innen)

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

Steinhorn, Charles
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.

Michaux, Christian
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.