Author | Ebbinghaus, Heinz-Dieter. author |
---|---|

Title | Finite Model Theory [electronic resource] / by Heinz-Dieter Ebbinghaus, Jรถrg Flum |

Imprint | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1995 |

Connect to | http://dx.doi.org/10.1007/978-3-662-03182-7 |

Descript | XV, 327 p. online resource |

SUMMARY

Finite model theory has its origins in classical model theory, but owes its systematic development to research from complexity 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, and optimization and approximation problems. The book is written in such a way that the resp. parts on model theory and descriptive complexity theory may be read independently

CONTENT

0. Preliminaries -- 1. The Ehrenfeucht-Fraรฏssรฉ Method -- 2. More on Games -- 3. 0โ{128}{147}1 Laws -- 4. Satisfiability in the Finite -- 5. Finite Automata and Logic: A Microcosm of Finite Model Theory -- 6. Descriptive Complexity Theory -- 7. Logics with Fixed-Point Operators -- 8. Logic Programs -- 9. Optimization Problems -- 10. Quantifiers and Logical Reductions -- References

Mathematics
Algorithms
Mathematical logic
Mathematics
Mathematical Logic and Foundations
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages