Finite and algorithmic model theory / edited by Javier Esparza, Christian Michaux, Charles Steinhorn.

Contributor(s):

Material type: Text

TextSeries: London Mathematical Society lecture note series ; 379.Publication details: Cambridge ; New York : Cambridge University Press, 2011.Description: xi, 341 p. : ill. ; 23 cmISBN:

9780521718202 (pbk.)

Subject(s):

DDC classification:

511.34 FIN

Online resources:

Cover image

Contents:

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 -- Definability in classes of finite structures / Dugald Macpherson and Charles Steinhorn -- Algorithmic meta-theorems / Stephan Kreutzer -- Model theoretic methods for fragments of FO and special classes of (finite) structures / Martin Otto.

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"--Provided by publisher.

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Books	H.T. Parekh Library	SIAS Collection	511.34 FIN (Browse shelf(Opens below))	Available		K951

Browsing H.T. Parekh Library shelves, Collection: SIAS Collection Close shelf browser (Hides shelf browser)

Previous								Next
Previous	511.322 POT Set theory and its philosophy: a critical introduction /	511.322 SET Sets and computations /	511.33 LAT Lattice Path Combinatorics and Applications /	511.34 FIN Finite and algorithmic model theory /	511.35 HOP Introduction to automata theory, languages, and computation /	511.35 HOP Introduction to automata theory, languages, and computation /	511.35 SIP Introduction to the theory of computation /	Next

TRPHO/2019/CRB/330/65
GBP 57.00

Includes bibliographical references and index.

Includes bibliographical references.

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

There are no comments on this title.

to post a comment.