Finite and Algorithmic Model Theory (eBook, PDF)

Redaktion: Esparza, Javier

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Cambridge University Press
• Erscheinungstermin: 10. März 2011
• Englisch
• ISBN-13: 9781139118606
• Artikelnr.: 56705747

Inhaltsangabe

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.