Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
The following link can be shared to navigate to this page. You can select the link to copy or click the 'Copy To Clipboard' button below.
Copy To Clipboard
Successfully Copied!
Descriptive Complexity and Finite Models
 
Edited by: Neil Immerman University of Massachusetts, Amherst, MA
Phokion G. Kolaitis University of California, Santa Cruz, Santa Cruz, CA
A co-publication of the AMS and DIMACS
Front Cover for Descriptive Complexity and Finite Models
Available Formats:
Hardcover ISBN: 978-0-8218-0517-6
Product Code: DIMACS/31
List Price: $76.00
MAA Member Price: $68.40
AMS Member Price: $60.80
Electronic ISBN: 978-1-4704-3989-7
Product Code: DIMACS/31.E
List Price: $71.00
MAA Member Price: $63.90
AMS Member Price: $56.80
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $114.00
MAA Member Price: $102.60
AMS Member Price: $91.20
Front Cover for Descriptive Complexity and Finite Models
Click above image for expanded view
  • Front Cover for Descriptive Complexity and Finite Models
  • Back Cover for Descriptive Complexity and Finite Models
Descriptive Complexity and Finite Models
Edited by: Neil Immerman University of Massachusetts, Amherst, MA
Phokion G. Kolaitis University of California, Santa Cruz, Santa Cruz, CA
A co-publication of the AMS and DIMACS
Available Formats:
Hardcover ISBN:  978-0-8218-0517-6
Product Code:  DIMACS/31
List Price: $76.00
MAA Member Price: $68.40
AMS Member Price: $60.80
Electronic ISBN:  978-1-4704-3989-7
Product Code:  DIMACS/31.E
List Price: $71.00
MAA Member Price: $63.90
AMS Member Price: $56.80
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $114.00
MAA Member Price: $102.60
AMS Member Price: $91.20
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 311997; 248 pp
    MSC: Primary 68; 03;

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

  • Table of Contents
     
     
    • Chapters
    • Easier ways to win logical games
    • On the expression of graph properties in some fragments of monadic second-order logic
    • Finite models, automata, and circuit complexity
    • Databases and finite-model theory
    • Why is modal logic so robustly decidable?
    • Model checking and the mu-calculus
    • Algebraic propositional proof systems
  • Request Review Copy
Volume: 311997; 248 pp
MSC: Primary 68; 03;

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

  • Chapters
  • Easier ways to win logical games
  • On the expression of graph properties in some fragments of monadic second-order logic
  • Finite models, automata, and circuit complexity
  • Databases and finite-model theory
  • Why is modal logic so robustly decidable?
  • Model checking and the mu-calculus
  • Algebraic propositional proof systems
Please select which format for which you are requesting permissions.