Finite and algorithmic model theory
著者
書誌事項
Finite and algorithmic model theory
（London Mathematical Society lecture note series, 379）
Cambridge University Press, 2011
- : pbk
大学図書館所蔵 全41件
注記
Bibliography: p. 339-341
内容説明・目次
内容説明
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.
目次
- Preface Javier Esparza, Christian Michaux and Charles Steinhorn
- Automata-based presentations of infinite structures Vince Barany, Erich Gradel and Sasha Rubin
- Logical aspects of spatial databases Bart Kuijpers and Jan Van den Bussche
- Some connections between finite and infinite model theory Vera Koponen
- Algorithmic meta-theorems Stephan Kreutzer
- Definability in classes of finite structures H. Dugald Macpherson and Charles Steinhorn
- Model theoretic methods for fragments of FO and special classes of (finite) structures Martin Otto.
「Nielsen BookData」 より