- #1
Leanna
- 8
- 0
I'm stuck on this proof question:
(¬(Q⇒¬P) ∧ ¬((Q∧¬R)⇒¬P )) ⇔ ¬(R ∨ (P ⇒¬Q))
I've tried to get rid of the negation and implications but I keep going in circles and I'm getting nowhere near to the equivalence required. I would appreciative if anyone can help me solve this because it's really been doing my head in :/
(¬(Q⇒¬P) ∧ ¬((Q∧¬R)⇒¬P )) ⇔ ¬(R ∨ (P ⇒¬Q))
I've tried to get rid of the negation and implications but I keep going in circles and I'm getting nowhere near to the equivalence required. I would appreciative if anyone can help me solve this because it's really been doing my head in :/