| Elements of Finite Model Theory 2004 Edition Contributor(s): Libkin, Leonid (Author) |
|
 |
ISBN: 3540212027 ISBN-13: 9783540212027 Publisher: Springer OUR PRICE: $94.99 Product Type: Hardcover - Other Formats Published: July 2004 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Computers | Computer Science - Mathematics | Logic - Computers | Databases - General |
| Dewey: 511.34 |
| LCCN: 2004105855 |
| Series: Texts in Theoretical Computer Science. an Eatcs |
| Physical Information: 0.88" H x 6.32" W x 9.5" (1.37 lbs) 318 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other areas, such as formal methods and verification, and artificial intelligence, have been discovered. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable; in other words, completeness fails over finite models. The tech- nique of the proof, based on encoding Turing machine computations as finite structures, was reused by Fagin almost a quarter century later to prove his cel- ebrated result that put the equality sign between the class NP and existential second-order logic, thereby providing a machine-independent characterization of an important complexity class. In 1982, Immerman and Vardi showed that over ordered structures, a fixed point extension of first-order logic captures the complexity class PTIME of polynomial time computable propertiE s. Shortly thereafter, logical characterizations of other important complexity classes were obtained. This line of work is often referred to as descriptive complexity. A different line of finite model theory research is associated with the de- velopment of relational databases. By the late 1970s, the relational database model had replaced others, and all the basic query languages for it were es- sentially first-order predicate calculus or its minor extensions. |