A note on the computational complexity of the pure classical implication calculus

DOI10.1016/0020-0190(89)90086-0zbMath0688.68047OpenAlexW2058436375MaRDI QIDQ1263982

Gunnar Stålmarck

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90086-0

zbMATH Keywords

computational complexitypropositional logicNP-completenessco-NP complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05)

Related Items (2)

The complexity of minimum partial truth assignments and implication in negation-free formulae ⋮ Two results in negation-free logic

Cites Work

• The relative efficiency of propositional proof systems
• The complexity of theorem-proving procedures

This page was built for publication: A note on the computational complexity of the pure classical implication calculus