nptelhrd
Introduction to Logic by Dr. A.V. Ravishankar Sarma,Department of Humanities and Social Sciences,IIT Kanpur.For more details on NPTEL visit http://nptel.ac.in .
Similar Posts
20 thoughts on “Mod-01 Lec-19 Semantic Tableaux Method for Propositional Logic”
Comments are closed.
Precise Explanation . Thanks for the video
Thank you soo much sir,
some what confusion. sir
very well explained . Thank you !
At 26:00 . Both the counter examples have same p , q and r. How ?
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).
Best explanation I've ever seen. Been stumped for the last 3 hours on one question. Thank you mister Sarma!
I was struggling to understand this part of the subject. Now its time to try some exercises on my own. Thank you.
excellent
Thanks a lot.You are a great teacher
God bless this Professor for making this so simple. We need more teacher like him.
Very well explained..Much appreciated
Thanks this was really helpful
I wish I watched this before discrete mathematics test chow me.
Salve FROM BRAZIL!!!
Amazing explaination!
Honestly this is a pretty bad explanation. I'm happy that I have a good Logic scholar.
so, is that argument is valid or not? you say one thing and then you change your own statement.
Didn't know international students used it too
Damn
Is it logical to say that i love this teacher so much?