Prove each of the following assertions:
-
Every pair of propositional clauses either has no resolvents, or all their resolvents are logically equivalent.
-
There is no clause that, when resolved with itself, yields (after factoring) the clause $(\lnot P \lor \lnot Q)$.
-
If a propositional clause $C$ can be resolved with a copy of itself, it must be logically equivalent to $ True $.
Answer
Improve This Solution
View Answer