Finite and Algorithmic Model Theory
Part of London Mathematical Society Lecture Note Series
- Editors:
- Javier Esparza, Technische Universität München
- Christian Michaux, Université de Mons, Belgium
- Charles Steinhorn, Vassar College, New York
- Date Published: March 2011
- availability: Temporarily unavailable - available from TBC
- format: Paperback
- isbn: 9780521718202
Paperback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact [email protected] providing details of the course you are teaching.
-
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- Model theoretic methods are applied to hot topics in theoretical computer science
- Provides a gentle, accessible introduction to cutting-edge topics
- Encourages further interaction between the computer science and mathematical logic communities
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: March 2011
- format: Paperback
- isbn: 9780521718202
- length: 356 pages
- dimensions: 226 x 153 x 18 mm
- weight: 0.52kg
- contains: 55 b/w illus.
- availability: Temporarily unavailable - available from TBC
Table of Contents
Preface Javier Esparza, Christian Michaux and Charles Steinhorn
Automata-based presentations of infinite structures Vince Bárány, Erich Grä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.
related journals
also by this author
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×