Can you show that NAND is a complete set by itself?LOL, it wasn't my problem of, my problem how to disprove that a specific function isn't a complete set at all? isn't there any other quick steps for verifying it's a complete set or not?
and lets say I have an operators {XOR,NAND} and asking me if it's a complete set or not? how would I even get started? can you solve it for me to know just how the things go behind of this logic?
If so, then any set that either contains a NAND or can implement a NAND is a complete set. Similarly, any set that either contains a NOR or can implement a NOR is a complete set.