Discrete Math - 1.3.1 “Proving” Logical Equivalences with Truth Tables

This video focuses on showing that two compound propositions are equivalent using a truth table.

Video Chapters:
Introduction 0:00
Some Terminology 0:11
Show Two Compound Propositions are Logically Equivalent 3:40
Practice With Me 8:08
Practice On Your Own 11:09
Up Next 16:04

Textbook: Rosen, Discrete Mathematics and Its Applications, 7e

[nimitoza]

Best comprehensive course on discrete Math

[chessketeer]

I've just constructed 18 truth tables from the course book so this is very clear. Thank you for truly wonderful lessons.

[frostdesigns]

Truth Tables are an absolute must for programmers!

[quran]

Thank you so much!
I didn't even think that I'm capable of understand this kind of stuff until you explained.
And jokes in between makes it so exciting btw. Love you!🌹

[abdulahusen]

Thanks a lot professor, I have one single question,
first you said tautology means every truth values should be true (not same), then you mentioned that tautology means they have the same truth values in all possible cases, and I think it's definition for equivalent not for tautology, am I right ?

[ikhushiverma_]

These are really effective! I appreciate your efforts, tutor ✨❤️

[jeycee]

Diet Dr. Pepper is delicious...may as well be a tautology.

[netanelkaye]

at 8:50 what exactly constitutes a "part" of a proposition?

[furkanalperenarc]

Thank you so much, these videos are the best!

[premium]

Thanks a lot u help me🥺I understand it now

[micaherguiza]

thanks for elaborating this topic😊this was a big to me!💙

[Nathan--cngp]

Why is not p and not q f, t, t, t, when not p and not q is just p and q listed from the bottom of the chart: meaning row 1 and 4 truth values will switch, but also, row 2 and 3 truth values will switch: meaning both negative row 2 and 3 truth values will switch to the same false truth value: leading to f, f, f, t?

not (p A q) = not p A not q.