This is a thoroughly revised and enlarged second edition (the first edition was published in the "Perspectives in Mathematical Logic" series in 1995) that 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. The book is written in such a way that the respective parts on model theory and descriptive complexity theory may be read independently.
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, 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.
Author(s): Heinz-Dieter Ebbinghaus, Jörg Flum
Series: Springer Monographs in Mathematics
Edition: 2nd
Publisher: Springer
Year: 2006
Language: English
Pages: 362
Tags: Mathematical Logic and Foundations; Mathematical Logic and Formal Languages
Front Matter....Pages I-XI
Preliminaries....Pages 1-12
The Ehrenfeucht-Fraïssé Method....Pages 13-35
More on Games....Pages 37-69
0-1 Laws....Pages 71-93
Satisfiability in the Finite....Pages 95-103
Finite Automata and Logic: A Microcosm of Finite Model Theory....Pages 105-117
Descriptive Complexity Theory....Pages 119-164
Logics with Fixed-Point Operators....Pages 165-238
Logic Programs....Pages 239-273
Optimization Problems....Pages 275-285
Logics for PTIME....Pages 287-306
Quantifiers and Logical Reductions....Pages 307-338
Back Matter....Pages 339-360