ATT WASIQSS: Given any statement, is it possible to find a logically equivalent statement using only ~ and ⋀ ? Justify your answer.
omg frikkin difficult :P
completeness of boolean algebra
Well pippa no idea :P
Tell me what those two signs mean, and let me thinky thinky?
i wld say no
~ negation ^ and
Yes, it is
Well, I'm not sure, but I know that any logic gate can be constructed with only Nand gates
yeah i think so too, but it is rather a pain
I've done that part myself.
Im running :D
hmmm never seen that i have only learnt abt de morgans laws so far
what is nand gates
it is electronics
in o 00 1 11 0 01 1 10 1
accomplish inversion and and
Basically the negation of the AND gate
i think the idea is this first you can show that you can use \(\lnot, \land \) and \(\lor\) to create all "disjunctive normal forms"
but i can only use ^ and ~
Well, a combination of AND and NOT can create the others.
then by demorgan, \(p\lor q\) is equavelent to \(\lnot(\lnot p \land \lnot q)\)
so that gets rid of the \(\lor\) and you are done, modulo a raft of details
ohh i misread teh question hahahahahhaha
i am dumb wasiqss lol
Join our real-time social learning platform and learn together with your friends!