Discrete Mathematics Unit 1 Set Theory And Logic
Proving two propositions are logically equivalent (without truth table) Ask Question 0 I have to prove that ~p→ (q→r)≡ q→ (pvr) This is what I've done so far q→ (pvr) ≡ (q→p)v (q→r) ≡ ~ (q→p)→The logical statement ∼(∼p∨q)∨(p∧r)∧(∼q∧r) is equivalent to A (p∧r)∧∼q B (∼p∧∼q)∧r C ∼p∨r D (p∧∼q)∨r Medium Solution Verified by Toppr Correct option is A) s∼(∼p∨q)∧(p∧r)∧(∼q∧r)
