Muutke küpsiste eelistusi

Elements of Finite Model Theory 2004 ed. [Kõva köide]

  • Formaat: Hardback, 318 pages, kõrgus x laius: 235x155 mm, kaal: 1440 g, 7 Illustrations, black and white; XIV, 318 p. 7 illus., 1 Hardback
  • Sari: Texts in Theoretical Computer Science. An EATCS Series
  • Ilmumisaeg: 02-Jul-2004
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540212027
  • ISBN-13: 9783540212027
Teised raamatud teemal:
  • Kõva köide
  • Hind: 85,76 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 100,89 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Hardback, 318 pages, kõrgus x laius: 235x155 mm, kaal: 1440 g, 7 Illustrations, black and white; XIV, 318 p. 7 illus., 1 Hardback
  • Sari: Texts in Theoretical Computer Science. An EATCS Series
  • Ilmumisaeg: 02-Jul-2004
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540212027
  • ISBN-13: 9783540212027
Teised raamatud teemal:
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.

Arvustused

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 Libkins 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 Libkins 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)

Introduction
1(12)
A Database Example
1(3)
An Example from Complexity Theory
4(2)
An Example from Formal Language Theory
6(2)
An Overview of the Book
8(2)
Exercises
10(3)
Preliminaries
13(10)
Background from Mathematical Logic
13(4)
Background from Automata and Computability Theory
17(2)
Background from Complexity Theory
19(2)
Bibliographic Notes
21(2)
Ehrenfeucht-Fraisse Games
23(22)
First Inexpressibility Proofs
23(3)
Definition and Examples of Ehrenfeucht-Fraisse Games
26(6)
Games and the Expressive Power of FO
32(1)
Rank-k Types
33(2)
Proof of the Ehrenfeucht-Fraisse Theorem
35(2)
More Inexpressibility Results
37(3)
Bibliographic Notes
40(1)
Exercises
41(4)
Locality and Winning Games
45(22)
Neighborhoods, Hanf-locality, and Gaifman-locality
45(4)
Combinatorics of Neighborhoods
49(2)
Locality of FO
51(3)
Structures of Small Degree
54(3)
Locality of FO Revisited
57(5)
Bibliographic Notes
62(1)
Exercises
63(4)
Ordered Structures
67(20)
Invariant Queries
67(2)
The Power of Order-invariant FO
69(4)
Locality of Order-invariant FO
73(10)
Bibliographic Notes
83(1)
Exercises
83(4)
Complexity of First-Order Logic
87(26)
Data, Expression, and Combined Complexity
87(2)
Circuits and FO Queries
89(4)
Expressive Power with Arbitrary Predicates
93(2)
Uniformity and AC0
95(4)
Combined Complexity of FO
99(1)
Parametric Complexity and Locality
99(3)
Conjunctive Queries
102(6)
Bibliographic Notes
108(1)
Exercises
109(4)
Monadic Second-Order Logic and Automata
113(28)
Second-Order Logic and Its Fragments
113(3)
MSO Games and Types
116(3)
Existential and Universal MSO on Graphs
119(5)
MSO on Strings and Regular Languages
124(3)
FO on Strings and Star-Free Languages
127(2)
Tree Automata
129(4)
Complexity of MSO
133(3)
Bibliographic Notes
136(1)
Exercises
137(4)
Logics with Counting
141(24)
Counting and Unary Quantifiers
141(4)
An Infinitary Counting Logic
145(6)
Games for L*∞ω (Cnt)
151(2)
Counting and Locality
153(2)
Complexity of Counting Quantifiers
155(3)
Aggregate Operators
158(3)
Bibliographic Notes
161(1)
Exercises
161(4)
Turing Machines and Finite Models
165(12)
Trakhtenbrot's Theorem and Failure of Completeness
165(3)
Fagin's Theorem and NP
168(6)
Bibliographic Notes
174(1)
Exercises
174(3)
Fixed Point Logics and Complexity Classes
177(34)
Fixed Points of Operators on Sets
178(2)
Fixed Point Logics
180(4)
Properties of LFP and IFP
184(8)
LFP, PFP, and Polynomial Time and Space
192(3)
Datalog and LFP
195(4)
Transitive Closure Logic
199(5)
A Logic for PTime?
204(2)
Bibliographic Notes
206(1)
Exercises
207(4)
Finite Variable Logics
211(24)
Logics with Finitely Many Variables
211(4)
Pebble Games
215(5)
Definability of Types
220(5)
Ordering of Types
225(4)
Canonical Structures and the Abiteboul-Vianu Theorem
229(3)
Bibliographic Notes
232(1)
Exercises
233(2)
Zero-One Laws
235(14)
Asymptotic Probabilities and Zero-One Laws
235(3)
Extension Axioms
238(3)
The Random Graph
241(2)
Zero-One Law and Second-Order Logic
243(2)
Almost Everywhere Equivalence of Logics
245(1)
Bibliographic Notes
246(1)
Exercises
247(2)
Embedded Finite Models
249(26)
Embedded Finite Models: the Setting
249(3)
Analyzing Embedded Finite Models
252(4)
Active-Generic Collapse
256(4)
Restricted Quantifier Collapse
260(5)
The Random Graph and Collapse to MSO
265(2)
An Application: Constraint Databases
267(3)
Bibliographic Notes
270(1)
Exercises
271(4)
Other Applications of Finite Model Theory
275(16)
Finite Model Property and Decision Problems
275(3)
Temporal and Modal Logics
278(7)
Constraint Satisfaction and Homomorphisms of Finite Models
285(3)
Bibliographic Notes
288(3)
References 291(14)
List of Notation 305(2)
Index 307(6)
Name Index 313


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