Descriptive Complexity and Finite Models: Proceedings of a Dimacs Workshop January 14-17, 1996 Princeton University (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)
| Author | : | |
| Rating | : | 4.40 (720 Votes) |
| Asin | : | 0821805177 |
| Format Type | : | paperback |
| Number of Pages | : | 248 Pages |
| Publish Date | : | 0000-00-00 |
| Language | : | English |
DESCRIPTION:
A nice collection of readable articles This book consists of seven articles on current research in Descriptive Complexity and Finite Models. To someone not in the field they can be viewed as pointers to the literature. As such the succeed quite well. Ronald Fagin's article on E-F games inspired me to read articles on the topic. Bruno Courcelle's article on Graph properties, and the two articles on temporal logic
It is an area of research existing between mathematical logic and computer science. Finite model theory can be succinctly described as the study of logics on finite structures. Each article is self-contained and provides a valuable introduction to the featured research areas connected with finite model theory.. This area has been developing through continuous interaction with computational complexity, database theory, and combinatorics. 'We hope that this small volume will suggest directions of synergy and contact for future researchers to build upon, creating connections and making discoveries that will help explain some of the many mysteries of computation' - from the Preface. The volume presents articles by leading researchers who delivered talks at the 'Workshop on Finite Models and Descriptive Complexity' at Princeton in January 1996 during a DIMACS-sponsored Special Year on Logic and Algorithms