Finite Model Theory and Descriptive Complexity

This publication has 87 references indexed in Scilit:

• On logics with two variables
  Theoretical Computer Science, 1999
• The modal mu-calculus alternation hierarchy is strict
  Theoretical Computer Science, 1998
• Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
  Annals of Pure and Applied Logic, 1996
• The monadic second-order logic of graphs IX: Machines and their behaviours
  Theoretical Computer Science, 1995
• An optimal lower bound on the number of variables for graph identification
  Combinatorica, 1992
• Unification as a complexity measure for logic programming
  The Journal of Logic Programming, 1987
• Fixed-point extensions of first-order logic
  Annals of Pure and Applied Logic, 1986
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
  The Journal of Logic Programming, 1984
• Groups, the Theory of ends, and context-free languages
  Journal of Computer and System Sciences, 1983
• Positional strategies for mean payoff games
  International Journal of Game Theory, 1979