Finite and algorithmic model theory /

"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 a...

Full description

Bibliographic Details
Other Authors: Esparza, Javier, Michaux, Christian, Steinhorn, Charles
Format: Printed Book
Language:English
Published: Cambridge ; New York : Cambridge University Press, 2011.
Series:London Mathematical Society lecture note series ; 379.
Subjects:
Computer science > Mathematics.
Finite model theory.
Online Access:Cover image
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
  • Definability in classes of finite structures / Dugald Macpherson and Charles Steinhorn
  • Algorithmic meta-theorems / Stephan Kreutzer
  • Model theoretic methods for fragments of FO and special classes of (finite) structures / Martin Otto.

Similar Items