@@ShivamGupta-qh8go im not arguing... I was just saying it's easy for those who know discrete mathematics cuz I thought u were saying about the CNF part
18:30 if we can use factoring to prove qVpVp ----> qVp , then going back to the previous example of will and jane, we can prove jVj ----> j and there is no need to take the negation of j as we have done to get an empty clause. So can someone please explain this?
Now I can't handle this subject.
Same lol this started off easy now it's getting tough
@@ShivamGupta-qh8go bro it's easy if you have studied discrete mathematics !
@@garbagebin3693 bro , its tough for ME , how can u argue with that? Also i was talking about the gradient
@@ShivamGupta-qh8go im not arguing... I was just saying it's easy for those who know discrete mathematics cuz I thought u were saying about the CNF part
@@garbagebin3693 okay, sorry i took it wrong. Thank you.
18:30 if we can use factoring to prove qVpVp ----> qVp , then going back to the previous example of will and jane, we can prove jVj ----> j and there is no need to take the negation of j as we have done to get an empty clause. So can someone please explain this?
Definitely too tough .. there's alot more to understand 🥴