Descriptive complexity and finite models : proceedings of a DIMACS workshop, January 14-17, 1996, Princeton University
著者
書誌事項
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, v. 31）
American Mathematical Society, c1997
大学図書館所蔵 件 / 全16件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references
"DIMACS Workshop on Descriptive Complexity and Finite Models, held at Princeton University in January 1996" -- Foreword
内容説明・目次
内容説明
'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.
「Nielsen BookData」 より
