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

שנה

2011

שפה

English

סדרה

London Mathematical Society lecture note series -- 379

הוצאה

Cambridge University Press

מהדורות

8

עמודים

341

ISBN

9780521718202

מקור הנתונים: Wikidata