Use the logical equivalences to show that:
(a) (¬p → (q → r)) ≡ (q → (p V r))
(b) ¬(p → ¬q) & ¬(p V q) is a contradiction (i.e. always false).
(c) (p V q) & (¬p V r) → (q V r) is a tautology (i.e. always true)
Printable View
Use the logical equivalences to show that:
(a) (¬p → (q → r)) ≡ (q → (p V r))
(b) ¬(p → ¬q) & ¬(p V q) is a contradiction (i.e. always false).
(c) (p V q) & (¬p V r) → (q V r) is a tautology (i.e. always true)
Hello, captainjapan!
. I call it ADI (alternate definition of implication).
On the left side we have:Quote:
![]()
. .
Quote:
is a contradiction (i.e. always false).
. .