"Finite and algorithmic model theory" - Information and Links:

Finite and algorithmic model theory - Info and Reading Options

Book's cover
The cover of “Finite and algorithmic model theory” - Open Library.

"Finite and algorithmic model theory" was published by Cambridge University Press in 2011 - Cambridge, it has 341 pages and the language of the book is English.


“Finite and algorithmic model theory” Metadata:

  • Title: ➤  Finite and algorithmic model theory
  • Author:
  • Language: English
  • Number of Pages: 341
  • Publisher: Cambridge University Press
  • Publish Date:
  • Publish Location: Cambridge

“Finite and algorithmic model theory” Subjects and Themes:

Edition Specifications:

  • Pagination: xi, 341 p. :

Edition Identifiers:

AI-generated Review of “Finite and algorithmic model theory”:


"Finite and algorithmic model theory" Table Of Contents:

  • 1- Preface / Javier Esparza, Christian Michaux and Charles Steinhorn
  • 2- Automata-based presentations of infinite structures / Vince Bárány, Erich Grädel and Sasha Rubin
  • 3- Logical aspects of spatial databases / Bart Kuijpers and Jan Van den Bussche
  • 4- Some connections between finite and infinite model theory / Vera Koponen
  • 5- Definability in classes of finite structures / Dugald Macpherson and Charles Steinhorn
  • 6- Algorithmic meta-theorems / Stephan Kreutzer
  • 7- Model theoretic methods for fragments of FO and special classes of (finite) structures / Martin Otto.

"Finite and algorithmic model theory" Description:

The Open Library:

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

Open Data:

"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

Read “Finite and algorithmic model theory”:

Read “Finite and algorithmic model theory” by choosing from the options below.

Search for “Finite and algorithmic model theory” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Finite and algorithmic model theory” in Libraries Near You:

Read or borrow “Finite and algorithmic model theory” from your local library.

Buy “Finite and algorithmic model theory” online:

Shop for “Finite and algorithmic model theory” on popular online marketplaces.