Erich Grädel, Phokion Kolaitis, Libkin G., Marx Leonid, Spencer Maarten, Vardi Joel, Y. Moshe, Yde Venema & Scott Weinstein
This book gives a comprehensive overview of central themes of finite model theory â expressive power, descriptive complexity, and zero-one laws â together with selected applications relating to database theory and artificial intelligence, especially constraint databases and constraint satisfaction problems. The final chapter provides a concise modern introduction to modal logic, emphasizing the continuity in spirit and technique with finite model theory. This underlying spirit involves the use of various fragments of and hierarchies within first-order, second-order, fixed-point, and infinitary logics to gain insight into phenomena in complexity theory and combinatorics. The book emphasizes the use of combinatorial games, such as extensions and refinements of the Ehrenfeucht-Fraissé pebble game, as a powerful way to analyze the expressive power of such logics, and illustrates how deep notions from model theory and combinatorics, such as o-minimality and treewidth, arise naturally in the application of finite model theory to database theory and AI. Students of logic and computer science will find here the tools necessary to embark on research into finite model theory, and all readers will experience the excitement of a vibrant area of the application of logic to computer science
|Keywords||complexity computational descriptive finite generalized model quantifiers theory|
|Categories||categorize this paper)|
|Buy the book||$35.00 used (68% off) $77.50 new (29% off) $84.89 direct from Amazon (23% off) Amazon page|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Almost Everywhere Equivalence of Logics in Finite Model Theory.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1996 - Bulletin of Symbolic Logic 2 (4):422-443.
Computational Semantics for Monadic Quantifiers.Marcin Mostowski - 1998 - Journal of Applied Non--Classical Logics 8 (1-2):107--121.
On the Decision Problem for Two-Variable First-Order Logic.Erich Grädel, Phokion G. Kolaitis & Moshe Y. Vardi - 1997 - Bulletin of Symbolic Logic 3 (1):53-69.
A Finite Model Theorem for the Propositional Μ-Calculus.Dexter Kozen - 1988 - Studia Logica 47 (3):233 - 241.
Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures.Ian Hodkinson & Martin Otto - 2003 - Bulletin of Symbolic Logic 9 (3):387-405.
Comprehension of Simple Quantifiers. Empirical Evaluation of a Computational Model.Jakub Szymanik & Marcin Zajenkowski - 2009 - Cognitive Science: A Multidisciplinary Journal 34 (3):521-532.
Computational Complexity of Some Ramsey Quantifiers in Finite Models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2009 - Dissertation, University of Amsterdam
Truth Definitions in Finite Models.Leszek Aleksander Kołodziejczyk - 2004 - Journal of Symbolic Logic 69 (1):183-200.
The Finite Model Property for Various Fragments of Intuitionistic Linear Logic.Mitsuhiro Okada & Kazushige Terui - 1999 - Journal of Symbolic Logic 64 (2):790-802.
Theories of Arithmetics in Finite Models.M. Krynicki & K. Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
Added to index2012-03-18
Total downloads11 ( #400,652 of 2,163,981 )
Recent downloads (6 months)2 ( #188,660 of 2,163,981 )
How can I increase my downloads?