Title Statements
- Full title :Finite and algorithmic model theory / edited by Javier Esparza, Christian Michaux, Charles Steinhorn
Summary
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"
Read More ↓Edition Statements
- Publication Date:2011
Publication Statements
- Publisher(s):Cambridge University Press
- Place of Publication:Cambridge
- Language:eng
- Publication Date:2011
Notes
"This volume is based on the satellite workshop on Finite and Algorithmic Model Theory that took place at the University of Durham, January 9-13, 2006, to inaugurate the scientific program Logic and Algorithms held at the Isaac Newton Institute for Mathematical Sciences during the first six months of 2006."
The Physical Object
- Description:341 s. : : illustrations
Edition Identifiers
- ISBN:9780521718202, 0521718201
- oclc:ocn768326400
- LC Classification:QA9.7
- Dewey Decimal:511.34
Table of Contents
Machine generated contents note: Preface Javier Esparza, Christian Michaux and Charles Steinhorn; Automata-based presentations of infinite structures Vince Bárány, Erich Gra;del 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
Read More ↓Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Files & Downloads
-
Finite and Algorithmic Model Theory -- (.pdf)
PDF · 1.5 MB · updated -
Finite and algorithmic model theory -- (.pdf)
PDF · 1.5 MB · updated -
Finite and Algorithmic Model Theory -- (.pdf)
PDF · 3.1 MB · updated
Rate & Review