First Order Predicate Logic Without Negation is NP-Complete

Abstract

Techniques developed in the study of the complexity of finitely presented algebras are used to show that the problem of deciding validity of positive sentences in the language of first order predicate logic with equality is $\leq_{\log}$-complete for NP.