AMS Bookstore LOGO amslogo
Return to List  Item: 1 of 1   
Descriptive Complexity and Finite Models
Edited by: Neil Immerman, University of Massachusetts, Amherst, MA, and Phokion G. Kolaitis, University of California, Santa Cruz, CA
A co-publication of the AMS and DIMACS.
SEARCH THIS BOOK:

DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
1997; 248 pp; hardcover
Volume: 31
ISBN-10: 0-8218-0517-7
ISBN-13: 978-0-8218-0517-6
List Price: US$67
Member Price: US$53.60
Order Code: DIMACS/31
[Add Item]

Request Permissions

"We hope that this small volume will suggest directions of synergy and contact for future researchers to build upon, creating connections and making discoveries that will help explain some of the many mysteries of computation."

--from the Preface

Finite model theory can be succinctly described as the study of logics on finite structures. It is an area of research existing between mathematical logic and computer science. This area has been developing through continuous interaction with computational complexity, database theory, and combinatorics.

The volume presents articles by leading researchers who delivered talks at the "Workshop on Finite Models and Descriptive Complexity" at Princeton in January 1996 during a DIMACS-sponsored Special Year on Logic and Algorithms. Each article is self-contained and provides a valuable introduction to the featured research areas connected with finite model theory.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).

Table of Contents

  • R. Fagin -- Easier ways to win logical games
  • B. Courcelle -- On the expression of graph properties in some fragments of monadic second-order logic
  • H. Straubing -- Finite models, automata, and circuit complexity
  • V. Vianu -- Databases and finite-model theory
  • M. Y. Vardi -- Why is modal logic so robustly decidable?
  • E. A. Emerson -- Model checking and the mu-calculus
  • T. Pitassi -- Algebraic propositional proof systems
Powered by MathJax
Return to List  Item: 1 of 1   

  AMS Home | Comments: webmaster@ams.org
© Copyright 2014, American Mathematical Society
Privacy Statement

AMS Social

AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia