I have determine whether the following equivalence is true or not $$p ⇒ (q∨r) ≡ (p∧(\neg r)) ⇒ q$$ using logical equivalences definitions.
I am never able to do these sorts of questions correctly no matter what. It is just really hard for me to do these. I was really hoping someone could help me out with this since it seems no matter what I do for this question it is wrong.
When all else fails, you can always write the truth table for every expression and see if they are the same.
In this case, I suggest you first transform the two $A\implies B$ statements into $\neg A \vee B$, then continue from there on. Remember, you can always double check each step with truth tables! For example, if you have expression $A$ which you change into $A_1$ and then into $A_2$, you can write down all three tables and see if they are the same.