A note on the computational complexity of the pure classical implication calculus (Q1263982)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the computational complexity of the pure classical implication calculus |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the computational complexity of the pure classical implication calculus |
scientific article |
Statements
A note on the computational complexity of the pure classical implication calculus (English)
0 references
1989
0 references
computational complexity
0 references
propositional logic
0 references
NP-completeness
0 references
co-NP complete
0 references
