On the restricted equivalence for subclasses of propositional logic (Q3142267): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4013771 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4202942 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Resolution for quantified Boolean formulas / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4131648 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The polynomial-time hierarchy / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5604434 / rank | |||
Normal rank | |||
Latest revision as of 11:42, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the restricted equivalence for subclasses of propositional logic |
scientific article |
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
