NAND logic

Because the NAND function has functional completeness all logic systems can be converted into NAND gates – the mathematical proof for this was published by Henry M. Sheffer in 1913 in the Transactions of the American Mathematical Society (Sheffer 1913). This is also true for NOR gates. In principle, any combinatorial logic function can be realized with enough NAND gates.Q = A NAND B Because the NAND function has functional completeness all logic systems can be converted into NAND gates – the mathematical proof for this was published by Henry M. Sheffer in 1913 in the Transactions of the American Mathematical Society (Sheffer 1913). This is also true for NOR gates. In principle, any combinatorial logic function can be realized with enough NAND gates.