Finite and Algorithmic Model Theory (Paperback)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	London Mathematical Society Lecture Note Series
Release date:	March 2011
First published:	March 2011
Editors:	Javier Esparza • Christian Michaux • Charles Steinhorn
Dimensions:	226 x 153 x 18mm (L x W x T)
Format:	Paperback - Trade
Pages:	356
ISBN-13:	978-0-521-71820-2
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Mathematical foundations > General
LSN:	0-521-71820-1
Barcode:	9780521718202

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!