Finite and Algorithmic Model Theory

Häftad, Engelska, 2011

Del 379 i serien London Mathematical Society Lecture Note Series

871 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2011-03-10
Mått:153 x 226 x 18 mm
Vikt:520 g
Format:Häftad
Språk:Engelska
Serie:London Mathematical Society Lecture Note Series
Antal sidor:356
Förlag:Cambridge University Press
ISBN:9780521718202

Utforska kategorier

Mer om författaren

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.

Recensioner i media

"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

Innehållsförteckning

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.