In 47–50 (a) 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 logical equivalence p ∨ q ≡∼(∼p∧ ∼q) to rewrite each statement form using only ∧ and ∼.
p ∨ ∼q →r ∨ q
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.