Finite Model Theory

Finite model theory has roots in classical model theory, but owes its systematic development to research from complexity theory and database theory. The book presents the main results of descriptive complexity theory, that is, the connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. The logics that are important in this context include fixed-point logics, transitive closure logics, and also certain infinitary languages; their model theory is studied in full detail. Other topics include DATALOG languages, quantifiers and oracles, 0-1 laws, optimization and approximation problems.

This volume presents the main results of descriptive complexity theory: the connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. Important logics in this context include fixed-point logics, transitive closure logics, and also certain infinitary languages. Other topics include DATALOG languages, quantifiers and oracles, 0-1 laws, and optimization and approximation problems. The book is written in such a way that the respective parts on model theory and descriptive complexity theory may be read independently. This second edition is a thoroughly revised and enlarged version of the original text.

Explores connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds Includes important logics: fixed-point logics, transitive closure logics, and also certain infinitary languages Additional topics include DATALOG languages, quantifiers and oracles, 0-1 laws, and optimization and approximation problems The new Second Edition is thoroughly revised and enlarged Includes supplementary material: sn.pub/extras

Autorentext
Prof. Dr. H.-D. Ebbinghaus ist Leiter des Instituts für Mathematische Logik an der Universität Freiburg. Durch Veröffentlichungen hat der Autor einen hohen Bekanntheitsgrad in der Hochschulmathematik.

Inhalt
Preliminaries.- The Ehrenfeucht-Fraïssé Method.- More on Games.- 0-1 Laws.- Satisfiability in the Finite.- Finite Automata and Logic: A Microcosm of Finite Model Theory.- Descriptive Complexity Theory.- Logics with Fixed-Point Operators.- Logic Programs.- Optimization Problems.- Logics for PTIME.- Quantifiers and Logical Reductions.