Two results in negation-free logic

DOI10.1016/0893-9659(93)90083-YzbMATH Open0814.03003MaRDI QIDQ1324497FDOQ1324497

Arvind Kumar Gupta, James Delgrande

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 propositional logic (03B05) Classical first-order logic (03B10) Subsystems of classical logic (including intuitionistic logic) (03B20) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Title not available (Why is that?)
• The complexity of theorem-proving procedures
• On the Complexity of Timetable and Multicommodity Flow Problems
• Title not available (Why is that?)
• A note on the computational complexity of the pure classical implication calculus

Cited In (2)

• The ground-negative fragment of first-order logic is -complete
• Consistent Consequence for Boolean Equation Systems

   Recommendations

• Undecidability results on two-variable logics 👍 👎
• Undecidability results on two-variable logics 👍 👎
• Negation and paraconsistent logics 👍 👎
• Deductive capabilities of negationless predicate calculus 👍 👎
• On two fragments with negation and without implication of the logic of residuated lattices 👍 👎
• Title not available (Why is that?) 👍 👎
• Double-negation elimination in some propositional logics 👍 👎
• On two classical results in the first order logic 👍 👎
• On two classical results in the first order logic 👍 👎
• The basic constructive logic for negation-consistency 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1324497)