Two results in negation-free logic

DOI10.1016/0893-9659(93)90083-YzbMath0814.03003MaRDI QIDQ1324497

James P. Delgrande, Arvind Kumar Gupta

Publication date: 13 June 1995

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

NP-completenessderivability of logical implications between sentencesnegation-free fragment

Mathematics Subject Classification ID

Classical first-order logic (03B10) Complexity of computation (including implicit computational complexity) (03D15) Classical propositional logic (03B05) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (1)

Consistent Consequence for Boolean Equation Systems

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the computational complexity of the pure classical implication calculus
• On the Complexity of Timetable and Multicommodity Flow Problems
• The complexity of theorem-proving procedures

This page was built for publication: Two results in negation-free logic