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

- September 29th 2008, 03:12 PMcaptainjapanLogical equivalences
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) - September 29th 2008, 04:09 PMSoroban
Hello, captainjapan!

. I call it ADI (alternate definition of implication).

Quote:

. .

Quote:

is a contradiction (i.e. always false).

. .

- September 29th 2008, 04:16 PMPlato