We know that \((Y\to X)\equiv (\neg Y \vee X)\)without using truth table.
Show that (y→x)→x is logically equivalence to x V y. I would like some help solving it without using the truth table
no sorry I really can't I'm really bad at proving it to be logically equivalenceWe know that \((Y\to X)\equiv (\neg Y \vee X)\)
Lets apply that again \((\neg Y \vee X)\to X\equiv\neg(\neg Y \vee X)\vee X\)
Now\( \neg(\neg Y \vee X)\vee X\equiv ( Y \wedge\neg X)\vee X\equiv (Y\vee X)\wedge(\neg X\vee X)\)
Can you finish?
That response is is totally unhelpful. In order to help you, you must explain exactly what about my reply it is that you do not understand,no sorry I really can't I'm really bad at proving it to be logically equivalence
Alright, I can't solve it cause I have no clue what to do next.That response is is totally unhelpful. In order to help you, you must explain exactly what about my reply it is that you do not understand,
Start with \(p\to q\equiv \neg p\vee q\). Be complete.
uiv
Please try to be clear in replying .Alright, I can't solve it cause I have no clue what to do next.
Look I only know how to solve it with truth table,that's all. I have no clue how to solve it with the logical equivalence way,cause I have a hard time understanding the important equivalence laws that must be memorized and I don't know how to start.Please try to be clear in replying .
\((\neg Y \vee X)\to X\equiv\neg(\neg Y \vee X)\vee X\) Do you understand that step?
If not the write a sentence explaining exact why you do not understand the process.
If you want help, you need to help us by telling us what you know that we can use. We aren't going to give you a course in logic from the beginning, so we need a starting point.Look I only know how to solve it with truth table,that's all. I have no clue how to solve it with the logical equivalence way,cause I have a hard time understanding the important equivalence laws that must be memorized and I don't know how to start.