Elements of Finite Model Theory
Springer Berlin (Verlag)
978-3-642-05948-3 (ISBN)
The author has been with the department of computer science at the University of Toronto since 2000. Prior to that, he was a researcher at Bell Laboratories, and he spent two years visiting INRIA in France. His research interests are in the areas of database theory and applications of logic in computer science. He is coauthor/editor of: Constraint Databases Kuper, G., Libkin, L., Paredaens, J. (Eds.), 12.04.2000, ISBN 3-540-66151-4 Finite-Model Theory and Its Applications Grädel, E., Kolaitis, P.G. (et al.), 07.2004, ISBN 3-540-00428-9 Semantics in Databases Thalheim, B., Libkin, L. (Eds.), Vol. 1358, 25.02.1998, ISBN 3-540-64199-8
1 Introduction.- 2 Preliminaries.- 3 Ehrenfeucht-Fraïssé Games.- 4 Locality and Winning Games.- 5 Ordered Structures.- 6 Complexity of First-Order Logic.- 7 Monadic Second-Order Logic and Automata.- 8 Logics with Counting.- 9 Turing Machines and Finite Models.- 10 Fixed Point Logics and Complexity Classes.- 11 Finite Variable Logics.- 12 Zero-One Laws.- 13 Embedded Finite Models.- 14 Other Applications of Finite Model Theory.- References.- List of Notation.- Name Index.
From the reviews:
Model theory is the study of the logical properties of mathematical structures. Finite model theory arises when we focus our attention on finite structures, such as finite graphs (graphs with a finite number of nodes). This book presents the most important results of finite model theory in an extremely readable, yet careful and precise manner. Libkin himself is a master of the art, and this shows in his beautiful presentation of the material.
Ronald Fagin Manager, Foundations of Computer Science, IBM Almaden Research Center, San Jose, CA
"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 ... the book deals extensively with applications in databases, complexity theory, and formal languages, as well as other branches of computer science. ... 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." (PHINEWS, Vol. (7), 2005)
"Libkin has managed to produce an interesting treatment, in spite of the competition ... . I particularly liked the chapter on the locality of first order (FO) logic ... . there is an excellent chapter on FO model checking. I liked the careful distinction between data, expression, and combined and fixed parameter complexity. ... In summary, I welcome Libkin's book as an interesting text from the database point of view." (K. Lodaya, Computing Reviews, April, 2005)
"Connections have emerged between finite model theory and various areas in combinatorics and computer science ... . Leonid Libkin's new book ... is a beautiful introduction to these developments ... . The exposition is lucid throughout ... . The book is self-contained and makes an ideal text for self-study or for a 'topics in logic course' ... . A noteworthy feature ofthe book from this perspective is its wealth of exercises ... . Elements of Finite Model Theory is a wonderful text ... ." (Steven Lindell and Scott Weinstein, Journal of Logic, Language and Information, Vol. 16 (2), 2007)
"The present book stands out by its broadness of topics (while staying within the confines of finite model theory), its detailed exposition (with great attention to the relationships between the different topics), and its inclusion of more recent results and trends. This book provides the best overview of the field to date. ... Every chapter ends with a set of exercises ... . The book can be used as a research reference as well as for teaching at the advanced graduate level." (Jan G. Van den Bussche, Mathematical Reviews, Issue 2007 a)
"Finite model theory is the study of the expressive power and, more generally, the behaviour of logics on finite structures. ... The audience of the book, as intended by the author, is formed by theoretical computer scientists. ... This excellent book will be a great help for teachers and students of finite model theory, but also for researchers in other fields of mathematics or computer science that want to gain familiarity with the most important concepts and results from finite model theory." (Heribert Vollmer, Zentralblatt MATH, Vol. 1060, 2006)
Erscheint lt. Verlag | 3.12.2010 |
---|---|
Reihe/Serie | Texts in Theoretical Computer Science. An EATCS Series |
Zusatzinfo | XIV, 318 p. 7 illus. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 498 g |
Themenwelt | Mathematik / Informatik ► Informatik |
Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika | |
Schlagworte | Abstract Devices • Algorithm analysis and problem complexity • Artificial Intelligence • Automat • Automata • Complexitiy Theory • Complexity • Complexity theory • Computation • Database Management • Finite model theory • formal language • Formal Languages • formal methods • Logic • Logics and Meanings • Mathematical Logic • model Theory • Variable |
ISBN-10 | 3-642-05948-1 / 3642059481 |
ISBN-13 | 978-3-642-05948-3 / 9783642059483 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich