The complexity of resource-bounded first-order classical logic

This publication has 17 references indexed in Scilit:

• First-Order Logic and Automated Theorem Proving
  Published by Springer Nature ,1990
• Complexity of matching problems
  Journal of Symbolic Computation, 1987
• Linear logic
  Theoretical Computer Science, 1987
• Automated Theorem Proving
  Published by Springer Nature ,1987
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
  The Journal of Logic Programming, 1984
• The undecidability of the second-order unification problem
  Theoretical Computer Science, 1981
• Positive First-Order Logic Is NP-Complete
  IBM Journal of Research and Development, 1981
• Theorem Proving via General Matings
  Journal of the ACM, 1981
• Correction to A note on the Entscheidungsproblem
  The Journal of Symbolic Logic, 1936
• A note on the Entscheidungsproblem
  The Journal of Symbolic Logic, 1936