Show that $\neg$ and $\wedge$ form a functionally complete collection of logical operators
Can someone give a hint?
Show that $\neg$ and $\wedge$ form a functionally complete collection of logical operators
Can someone give a hint?
Copyright © 2021 JogjaFile Inc.
Hint. $p \vee q$ is equivalent to $\neg (\neg p \wedge \neg q)$ and $p \to q$ is equivalent to $q \vee \neg p$.