Question: Let p, q, r denote primitive statements. (a) Use truth tables to verify the following logical equivalences. (i) p (q r) (p
Let p, q, r denote primitive statements.
(a) Use truth tables to verify the following logical equivalences.
(i) p → (q ∧ r) ⇔ (p → q) ∧ (p → r)
(ii) [(p ∨ q) → r] ⇔ [(p → r) ∧ (q → r)]
(iii) [p → (q ∨ r)] ⇔ [¬r → (p → q)]
(b) Use the substitution rules to show that
[p → (q ∨ r)] [(p ∧ ¬q) → r].
Step by Step Solution
3.36 Rating (159 Votes )
There are 3 Steps involved in it
a i ii iii b p q r r p q From part iii of part a r p q By the 2nd Substitution Rule and p 9 p q p q ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
954-M-L-A-L-S (7329).docx
120 KBs Word File
