𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Finite Model Theory and Its Applications

✍ Scribed by Erich GrÀdel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y. Vardi, Yde Venema, Scott Weinstein


Publisher
Springer
Year
2007
Tongue
English
Leaves
452
Series
Texts in Theoretical Computer Science. An EATCS Series
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


Finite Model Theory and Its Applications
✍ Erich GrΓ€del, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Mo πŸ“‚ Library πŸ“… 2007 πŸ› Springer 🌐 English

<span>Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our unders

Macrosystems Theory and its Applications
✍ Yury S. Popkov πŸ“‚ Library πŸ“… 1995 πŸ› Springer 🌐 English

Macrosystems are systems in which the stochastic behaviour of the elements is transformed into deterministic behaviour of the system as a whole. This publication discusses equilibrium in these systems. Mathematical models of stationary states using the principle of maximum entropy are presented. Thi