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

Full description

Saved in:
Bibliographic Details
Other Authors: Esparza, Javier (Editor), Michaux, Christian (Editor), Steinhorn, Charles (Editor)
Format: Electronic eBook
Language:English
Published: Cambridge Cambridge University Press 2011
Series:London Mathematical Society lecture note series 379
Subjects:
Online Access:BSB01
FHN01
Volltext
Summary: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
Item Description:Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Physical Description:1 online resource (xi, 341 pages)
ISBN:9780511974960
DOI:10.1017/CBO9780511974960

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text