Cargando…

Finite and algorithmic model theory /

"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 a...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Otros Autores: Esparza, Javier, Michaux, Christian, Steinhorn, Charles
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cambridge ; New York : Cambridge University Press, 2011.
Colección:London Mathematical Society lecture note series ; 379.
Temas:
Acceso en línea:Texto completo
Descripción
Sumario:"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"--Provided by publisher
Descripción Física:1 online resource (xi, 341 pages) : illustrations
Bibliografía:Includes bibliographical references and index.
Includes bibliographical references.
ISBN:9781139127097
1139127098
9780511974960
0511974965
9781139116435
1139116436