Mod-01 Lec-19 Semantic Tableaux Method for Propositional Logic

[queenofmoderation]

God bless this Professor for making this so simple. We need more teacher like him.

[cheat]

Best explanation I've ever seen. Been stumped for the last 3 hours on one question. Thank you mister Sarma!

[vladdelezo]

I was struggling to understand this part of the subject. Now its time to try some exercises on my own. Thank you.

[parwizibrahimi]

Thank you, sir. You are saving lives.

[bsal]

Now i'm feeling confident.Thanks a lot proFessor 🔥

[senthilcaesar]

Precise Explanation . Thanks for the video

[avashpalikhe]

best explanation among all videos in youtube

[hafeezahmed]

In the first example, p==>r is false in two conditions, (p=T, q=T and r=F) and (p = T, q=F and r=F). In the first case we can check for satisfiability of !(p==>r), but in the second case p==>q is itself false. It leads to ((p==>q AND q==>r) ==F), hence we don't check satisfiability of !(p==>r).

[gautalawrencebusa]

I wish I watched this before discrete mathematics test chow me.

[georgiosargyris]

at 0:51 says "When you have 2 variables you have 4 entries in the truth table. When you have 3 variables you have 8 entries to the truth table". Why 8?

[idreesiqbal]

so, is that argument is valid or not? you say one thing and then you change your own statement.

[malharjajoo]

At 26:00 . Both the counter examples have same p, q and r. How ?

[mythorganizer]

Didn't know international students used it too
Damn

[gustavbodenschatz]

Honestly this is a pretty bad explanation. I'm happy that I have a good Logic scholar.