Finite model theory has its origin 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.
Rezensionen / Stimmen
"..a concise exposition that is at the same time comprehensive and lucid, providing good motivations and clear examples. The book can be thoroughly recommended for self-study and reference, or for an advanced course on this vital new subject." New Zealand Mathematical Society Newsletter
Reihe
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Maße
Höhe: 23.5 cm
Breite: 15.5 cm
Gewicht
ISBN-13
978-3-540-60149-4 (9783540601494)
DOI
10.1007/978-3-662-03182-7
Schweitzer Klassifikation
0. Preliminaries.- 1. The Ehrenfeucht-Fraïssé Method.- 2. More on Games.- 3. 0-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.