Finite and Algorithmic Model Theory

by Edited by Javier Esparza , Christian Michaux , Charles Steinhorn

• ISBN13: 9780521718202
• ISBN10: 0521718201
• Format: Paperback
• Copyright: 2011-04-25
• Publisher: Cambridge University Press

Summary

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.

Table of Contents

Preface	p. vii
Automata-based presentations of infinite structures	p. 1
Logical aspects of spatial databases	p. 77
Some connections between finite and infinite model theory	p. 109
Definability in classes of finite structures	p. 140
Algorithmic meta-theorems	p. 177
Model theoretic methods for fragments of FO and special classes of (finite) structures	p. 271
Table of Contents provided by Ingram. All Rights Reserved.