On the restricted equivalence for subclasses of propositional logic (Q3142267)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 446226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the restricted equivalence for subclasses of propositional logic |
scientific article; zbMATH DE number 446226 |
Statements
On the restricted equivalence for subclasses of propositional logic (English)
0 references
15 November 1993
0 references
restricted equivalence problem
0 references
restricted implication problem
0 references
classes of propositional formulas
0 references
satisfiability problem
0 references
quantified Boolean formulas
0 references
quantified definite Horn formulas
0 references
algorithms
0 references
quantified 2CNF formulas
0 references
0.91728723
0 references
0.9023524
0 references
0.8925205
0 references
0.88448554
0 references
0.88426274
0 references
0.8821825
0 references
