Finite and algorithmic model theory

Locate

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today


Buy this book

Last edited by MARC Bot
December 23, 2022 | History

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.

Publish Date
Language
English
Pages
341

Buy this book

Previews available in: English

Edition Availability
Cover of: Finite and Algorithmic Model Theory
Finite and Algorithmic Model Theory
2011, Cambridge University Press
in English
Cover of: Finite and Algorithmic Model Theory
Finite and Algorithmic Model Theory
2011, Cambridge University Press
in English
Cover of: Finite and Algorithmic Model Theory
Finite and Algorithmic Model Theory
2011, Cambridge University Press
in English
Cover of: Finite and Algorithmic Model Theory
Finite and Algorithmic Model Theory
2011, Cambridge University Press
in English
Cover of: Finite and Algorithmic Model Theory
Finite and Algorithmic Model Theory
2011, Cambridge University Press
in English
Cover of: Finite and algorithmic model theory
Finite and algorithmic model theory
2011, Cambridge University Press
in English

Add another edition?

Book Details


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

Edition Notes

Includes bibliographical references and index.

Includes bibliographical references.

Published in
Cambridge, New York
Series
London Mathematical Society lecture note series -- 379, London Mathematical Society lecture note series -- 379.

Classifications

Dewey Decimal Class
511.3/4
Library of Congress
QA9.7 .F565 2011

The Physical Object

Pagination
xi, 341 p. :
Number of pages
341

ID Numbers

Open Library
OL24903426M
Internet Archive
finitealgorithmi00jesp
ISBN 10
0521718201
ISBN 13
9780521718202
LCCN
2010048062
OCLC/WorldCat
663441246

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
December 23, 2022 Edited by MARC Bot import existing book
August 2, 2020 Edited by ImportBot import existing book
June 30, 2019 Edited by MARC Bot import existing book
July 29, 2011 Created by LC Bot import new book