ENGLISH

Finite and Algorithmic Model Theory

By Charles Steinhorn , Javier Esparza , Christian Michaux

Book information

Publisher
Cambridge University Press
Year
2011
ISBN
0521718201, 978-0-521-71820-2
Language
english
Format
PDF
Filesize
3 MB (3210723 bytes)
Series
London Mathematical Society Lecture Note Series, Vol. 379
Edition
1st
Pages
356\355
Topic
Mathematics Logic
Time added
2014-02-12 18:00:00

Description

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 important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research

Similar books