Proving logical equivalence involving the biconditional
Step by step description of exercise 16 from our text.
Using key logical equivlances we will show p iff q is logically equivalent to (p AND q) OR (NOT p AND NOT q)
Step by step description of exercise 16 from our text.
Using key logical equivlances we will show p iff q is logically equivalent to (p AND q) OR (NOT p AND NOT q)
Пікірлер: 16
Thanks for making this video public! I'm taking a similar course at the University of Washington and this really helped demystify writing proofs involving biconditionals for me.
You are a saint of a woman. Thank you sooooo much. I have been working this problem for two days now and you have helped me through the end.
You made it seem like nothing, when I was feeling like this was so insurmountable. Your teaching style was very reassuring, and I super super appreciate your help at a tough time.
nicely done....well explained, thanks
Wow. You are so amazing. Thank you ! ^^
thank u from north africa thank uuuuuu
Helped a lot, thank you.
Hi Kailee! Could you make a video proving all the statements in table 8 (logical equivalences involving biconditional statements) or direct me to resources on their full proofs? I'm trying to prove the last equivalence statement where the negation of a biconditional is equivalent to p being biconditional to the negation of q. Thanks!
thank u so much mam :) it helped a lot
Thank you. That was so helpful :)
Thankkk youuu 👌👌👌
Thanks you ver much !!!
Love you... Awesome
Hi ,,, Can I ask you please how can I understand the logical equivalences involving conditional statements, it's very hard to memorize all the methods T~T
thx ..
Hello, How would I proof. ~U (A^U)~R ~(~Rv~A) Derive not U from the following premises. Thanks to anyone who can help.