Finite and Algorithmic Model Theory
Javier Esparza editor Charles Steinhorn editor Christian Michaux editor
Format:Paperback
Publisher:Cambridge University Press
Published:10th Mar '11
Currently unavailable, and unfortunately no date known when it will be back
Surveys of current research in logical aspects of computer science that apply finite and infinite model-theoretic methods.
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. The chapters include extensive bibliographies.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.
"Researchers will find the book useful for referring to theorems on finite model theory. For building models of complicated problems, the book provides a good foundation." Maulik A. Dave, Computing Reviews
ISBN: 9780521718202
Dimensions: 226mm x 153mm x 18mm
Weight: 520g
356 pages