JavaScript is disabled for your browser. Some features of this site may not work without it.
First Order Predicate Logic Without Negation is NP-Complete

Author
Kozen, Dexter
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.
Date Issued
1977-04Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR77-307
Type
technical report