Descriptive Complexity and Finite Models
Seiten
1997
American Mathematical Society (Verlag)
978-0-8218-0517-6 (ISBN)
American Mathematical Society (Verlag)
978-0-8218-0517-6 (ISBN)
- Keine Verlagsinformationen verfügbar
- Artikel merken
Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This volume presents articles by leading researchers who delivered talks at the 'Workshop on Finite Models and Descriptive Complexity' at Princeton in January 1996.
'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. Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This area has been developing through continuous interaction with computational complexity, database theory, and combinatorics. 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. Each article is self-contained and provides a valuable introduction to the featured research areas connected with finite model theory.
'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. Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This area has been developing through continuous interaction with computational complexity, database theory, and combinatorics. 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. Each article is self-contained and provides a valuable introduction to the featured research areas connected with finite model theory.
Easier ways to win logical games by R. Fagin On the expression of graph properties in some fragments of monadic second-order logic by B. Courcelle Finite models, automata, and circuit complexity by H. Straubing Databases and finite-model theory by V. Vianu Why is modal logic so robustly decidable? by M. Y. Vardi Model checking and the mu-calculus by E. A. Emerson Algebraic propositional proof systems by T. Pitassi.
| Erscheint lt. Verlag | 30.4.1997 |
|---|---|
| Reihe/Serie | DIMACS: Series in Discrete Mathematics and Theoretical Computer Science |
| Zusatzinfo | Illustrations |
| Verlagsort | Providence |
| Sprache | englisch |
| Gewicht | 680 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Angewandte Mathematik |
| Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
| ISBN-10 | 0-8218-0517-7 / 0821805177 |
| ISBN-13 | 978-0-8218-0517-6 / 9780821805176 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 62,95
Anwendungen und Theorie von Funktionen, Distributionen und Tensoren
Buch | Softcover (2023)
De Gruyter Oldenbourg (Verlag)
CHF 97,90
