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)
Follow Math Help Forum on Facebook and Google+
Hello, captainjapan! . I call it ADI (alternate definition of implication). On the left side we have: . . is a contradiction (i.e. always false). . .
Originally Posted by Soroban . I call it ADI (alternate definition of implication). FYI: In formal logic it is called Material Implication (Impl)
View Tag Cloud