Show that $\neg$ and $\wedge$ form a functionally complete collection of logical operators

758 Views Asked by At

Show that $\neg$ and $\wedge$ form a functionally complete collection of logical operators

Can someone give a hint?

1

There are 1 best solutions below

1
On

Hint. $p \vee q$ is equivalent to $\neg (\neg p \wedge \neg q)$ and $p \to q$ is equivalent to $q \vee \neg p$.