Show simple item record

dc.contributor.authorKozen, Dexteren_US
dc.date.accessioned2007-04-23T17:51:14Z
dc.date.available2007-04-23T17:51:14Z
dc.date.issued1977-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR77-307en_US
dc.identifier.urihttps://hdl.handle.net/1813/7017
dc.description.abstractTechniques 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.en_US
dc.format.extent769326 bytes
dc.format.extent403921 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleFirst Order Predicate Logic Without Negation is NP-Completeen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics