Dominoes and the complexity of subclasses of logical theories

This publication has 20 references indexed in Scilit:

• A uniform method for proving lower bounds on the computational complexity of logical theories
  Annals of Pure and Applied Logic, 1990
• Subclasses of presburger arithmetic and the polynomial-time hierarchy
  Theoretical Computer Science, 1988
• The complexity of presburger arithmetic with bounded quantifier alternation depth
  Theoretical Computer Science, 1982
• Alternation
  Journal of the ACM, 1981
• Complexity of Boolean algebras
  Theoretical Computer Science, 1980
• The complexity of logical theories
  Theoretical Computer Science, 1980
• A bound on solutions of linear integer equalities and inequalities
  Proceedings of the American Mathematical Society, 1978
• The decision problem for standard classes
  The Journal of Symbolic Logic, 1976
• ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
  Proceedings of the National Academy of Sciences, 1962
• The first order properties of products of algebraic systems
  Fundamenta Mathematicae, 1959