use the logical equivalences p → q ≡∼p ∨ q and

p ↔ q ≡ (∼p ∨ q) ∧ (∼q ∨ p) to rewrite the given statement

forms without using the symbol → or ↔, and (b) use the logi-

cal equivalence p ∨ q ≡∼(∼p∧ ∼q) to rewrite each statement

form using only ∧ and ∼.

47. p ∧ ∼q → r

asked by guest
on Nov 23, 2024 at 7:36 am



Mathbot Says...

I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.