Part 2: Symbolic Logic (WFFs & calculating truth functional statements)

All ur videos are awesome. RESPECT!!

Absolutely great video.  I really appreciate that you don't skip those "obvious" steps.  They are not so obvious for the new guys that are just learning.  Thank You!

I've never been to a logic class in my life but this stuff is interesting and fun as hell! Yes I'm a weird one.

you should use ! for not

do you like pie ?

thank you so much for your video, this literally made me understand the whole concepts

Very helpul

What is the last one? My answer would be T.

Shouldn't (P->Q) be given an undetermined truth value when P is false and Q is true?

Surely you can't confirm that P implies Q only on the basis that Q is true.

As a matter of fact, by this logic, (P->Q) when both P and Q are true should also have an undetermined truth value. It's only in the case when P is true and Q is false that you can definitively say the (P->Q) statement is false. Any other combination of truth values for P and Q should give undetermined truth values for (P->Q).

This is the weirdest ASMR video I've ever seen

Correct me if I am wrong, but you did not complete #5 did you?
Otherwise loved the video. It's a pleasure to hear you reason out the steps above.

Amazingly well explained. Love your videos!

who dislike this💀

Sir , very nice explanation .👍👍
Thanks from India 🙏🙏

I love you bro