With the Idempotence you get the NOT operation...
$$\neg (A \vee A) = \neg A$$ ![]() Logic diagram NOT operation with a NOR operation. |
![]() Logic circuit NOT operation with a NOR operation. (Enlarge) |
With the double negation law you get the OR operation...
$$\neg ( \neg (A \vee B)) = (A \vee B)$$ ![]() Logic diagram AND operation with a NOR operation. |
![]() Logic circuit OR operation with a NOR operation. (Enlarge) |
With the De Morgan law you turn the NOR operation into a AND operation...
$$\neg ( \neg A \vee \neg B) = (A \wedge B)$$ ![]() Logic diagram AND operation with a NOR operation. |
![]() Logic circuit AND operation with a NOR operation. (Enlarge) |
Again, this has consequences for the completeness...