logic

Yes, as the other answers pointed out, the set of operators comprising of || and ! is functionally complete. Here’s a constructive proof of that, showing how to use them to express all sixteen possible logical connectives between the boolean variables A and B: True: A || !A A NAND B: !A || !B B … Read more