Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an impo
Finite and Algorithmic Model Theory
β Scribed by Javier Esparza, Christian Michaux, Charles Steinhorn
- Publisher
- Cambridge University Press
- Year
- 2011
- Tongue
- English
- Leaves
- 356
- Series
- London Mathematical Society Lecture Note Series, Vol. 379
- Edition
- 1st
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Because of their applications in so many diverse areas, finite fields continue to play increasingly important roles in various branches of modern mathematics, including number theory, algebra, and algebraic geometry, as well as in computer science, information theory, statistics, and engineering. Co
This is a thoroughly revised and enlarged second edition (the first edition was published in the "Perspectives in Mathematical Logic" series in 1995) that presents the main results of descriptive complexity theory, that is, the connections between axiomatizability of classes of finite structures and
This is the first edition. The second edition was published in the "Springer Monographs in Mathematics" series in 2005. The branch of model theory described in the present book and called finite model theory has its roots in classical model theory but owes its systematic development to research