This book is an introduction to finite model theory which stresses the computer science origins of the area. In addition to presenting the main techniques for analyzing logics over finite models, the book deals extensively with applications in databases, complexity theory, and formal languages, as well as other branches of computer science. It covers Ehrenfeucht-Fraïssé games, locality-based techniques, complexity analysis of logics, including the basics of descriptive complexity, second-order logic and its fragments, connections with finite automata, fixed point logics, finite variable logics, zero-one laws, and embedded finite models, and gives a brief tour of recently discovered applications of finite model theory.
This book can be used both as an introduction to the subject, suitable for a one- or two-semester graduate course, or as reference for researchers who apply techniques from logic in computer science.
Author(s): Leonid Libkin
Series: Texts in Theoretical Computer Science. An EATCS Series
Publisher: Springer
Year: 2004
Language: English
Pages: 319
Tags: Mathematical Logic and Formal Languages; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Database Management; Mathematical Logic and Foundations
Front Matter....Pages I-XIV
Introduction....Pages 1-11
Preliminaries....Pages 13-21
Ehrenfeucht-Fraïssé Games....Pages 23-43
Locality and Winning Games....Pages 45-65
Ordered Structures....Pages 67-85
Complexity of First-Order Logic....Pages 87-111
Monadic Second-Order Logic and Automata....Pages 113-140
Logics with Counting....Pages 141-163
Turing Machines and Finite Models....Pages 165-176
Fixed Point Logics and Complexity Classes....Pages 177-210
Finite Variable Logics....Pages 211-234
Zero-One Laws....Pages 235-248
Embedded Finite Models....Pages 249-273
Other Applications of Finite Model Theory....Pages 275-289
Back Matter....Pages 291-318