Комментарии:
love your videos man, really helpful, thank you veru much!!!
ОтветитьAmazing way of teaching...
ОтветитьDawDology !
ОтветитьWhat's more important than proving this thing is you gave a proper explanation of what a logical equivalent are🤦♂️ In my University the professor was just like read it this are formulas🤣
ОтветитьIf only the test is this easy
ОтветитьThanks
ОтветитьI have a test today and this confirmed I will be failing that exam.
ОтветитьIvanni nerchukoni....evadivi peekali raaa...bongulo maths....chaduvuthunte chiraaaku benguthundhi....🥲😤deenemma errihooku subject ...🔥
Ответить“Right”
ОтветитьThis is the hardest part of logic
Ответитьfor absorption law (a), another way to think is that either p or p and q needs to be true for the expression to be true. Hence if p is false, the expression has to be false and if p is true the expression has to be true. So its equivalent to p. Similar logic holds for (b)
ОтветитьThanks for your best tutorials!!🤩
Ответитьis there any sites where we can practice these questions
ОтветитьYour teaching is so nice or understanding thank
ОтветитьWould be nice if you put the correct answer to your question in description so i can confirm if my answer is correct or not.
Ответитьcan you just add some english sub?
ОтветитьI'm watching this for 7th time .. but still can't 💔
ОтветитьAwesome explanation!
ОтветитьGirl I don't Carpe Diem.
I Carpe Dior.
please provide the notes for all lectures🥲🥲
ОтветитьThank you Indian Guy(i dunno what's your race is) but it really help me a lot since I have midterm exam today
ОтветитьMade me realize how simple it is.
Ответитьthank you very much dude, I am just learning this for myself as I have graduated from school long time ago. but bruh! wat in the multiverse is this shoot! Aliens laugh at us with all these nonsensical convention we brought. I am learning and laughing at this!
Ответитьplease teach me!
ОтветитьExcellent !! Excellent!! nothing else to say.
You please do some video lectures ( even paid ) on model checking buchi automata etc.,
Negation(p implies q) equivalence p and negation of q
Using (p implies q) equivalence to negation of p or q
Negation ( negation of p or q) equivalence p and negation of q
Then use de Morgan rule
P and negation of q is equivalence to p and negation of q
sound quality is very bad
Ответитьcan somebody help me with conditional question #8
Ответить5th no solution:
¬(p->q)≡p^¬q...
Prove:
RHS=p^¬q
=¬(¬q->¬p) (as p^q=¬(q->¬p)
=¬(p->q) (as p->q=¬q->¬p)
=LHS
Thank you sir all of my doubts finally got cleared
ОтветитьATTENDANCE: BSIT-6A
REPLY TO THIS COMMENT FOR CONFIRMATION.
شكرا و جزاك الله خيرا
ОтветитьThanks
ОтветитьHELPFUL VDO
Ответить5. Question. Not(p->q) <=> p ^ Not q
Soln.
Not(Not p v Not q) <=> p ^ Not q
p ^ Not q <=> p ^ Not q
Tommorro is my CCE and I am here for the first time today😄
Ответитьnow this is the kind of stuff which is complicated and simple at the same time due to this channel !!!!!
ОтветитьTFTFTF😣😖😣😖😖😣😖😖😣😖😣😖😖😣😖😣😖😖😣😖😣😖😖😣😖😣😖
ОтветитьReally helpful and yes I have done my home work ☺️😁
Thank you sir 😊
great video!
ОтветитьAwesome man
ОтветитьThank you so much ❣❣💯💯❣❣
I am from Algeria and I enjoy to see your vedios🥰🥰🥰
discrete math makes me want to die
ОтветитьWhat is happening
ОтветитьCan I ask if a distributive can be two statements only, something like
(p v q) ^ ¬p ≡ ¬((p v q) →p)?