The complexity of the falsifiability problem for pure implicational formulas (Q5900975)
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: The complexity of the falsifiability problem for pure implicational formulas |
scientific article; zbMATH DE number 5722999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the falsifiability problem for pure implicational formulas |
scientific article; zbMATH DE number 5722999 |
Statements
The complexity of the falsifiability problem for pure implicational formulas (English)
0 references
17 June 2010
0 references
subject classification algorithms
0 references
data structures
0 references
logic in computer science
0 references
0.941792905330658
0 references
0.9405295252799988
0 references
0.856651246547699
0 references
0.7830208539962769
0 references
0.7672010064125061
0 references
