Descriptive Complexity and Finite Models - DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

7

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By American Mathematical Society

9780821805176, 9781470439897

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Finite models, automata, and circuit complexity

Descriptive Complexity and Finite Models - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/031/03 ◽

1997 ◽

pp. 63-96

Author(s):

Howard Straubing

Keyword(s):

Circuit Complexity ◽

Finite Models

Download Full-text

Databases and finite-model theory

Descriptive Complexity and Finite Models - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/031/04 ◽

1997 ◽

pp. 97-148 ◽

Cited By ~ 8

Author(s):

Victor Vianu

Keyword(s):

Model Theory ◽

Finite Model ◽

Finite Model Theory

Download Full-text

Easier ways to win logical games

Descriptive Complexity and Finite Models - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/031/01 ◽

1997 ◽

pp. 1-32 ◽

Cited By ~ 9

Author(s):

Ronald Fagin

Download Full-text

On the expression of graph properties in some fragments of monadic second-order logic

Descriptive Complexity and Finite Models - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/031/02 ◽

1997 ◽

pp. 33-62 ◽

Cited By ~ 14

Author(s):

Bruno Courcelle

Keyword(s):

Second Order ◽

Order Logic ◽

Graph Properties ◽

Second Order Logic ◽

Monadic Second Order Logic

Download Full-text

Algebraic propositional proof systems

Descriptive Complexity and Finite Models - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/031/07 ◽

1997 ◽

pp. 215-244 ◽

Cited By ~ 12

Author(s):

Toniann Pitassi

Keyword(s):

Proof Systems ◽

Propositional Proof Systems ◽

Propositional Proof

Download Full-text

Why is modal logic so robustly decidable?

Descriptive Complexity and Finite Models - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/031/05 ◽

1997 ◽

pp. 149-183 ◽

Cited By ~ 72

Author(s):

Moshe Vardi

Keyword(s):

Modal Logic

Download Full-text

Model checking and the mu-calculus

Descriptive Complexity and Finite Models - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/031/06 ◽

1997 ◽

pp. 185-214 ◽

Cited By ~ 50

Author(s):

E Emerson

Keyword(s):

Model Checking

Download Full-text