Functionally Incomplete Logical Connectives/Conjunction and Disjunction

Theorem
The set of logical connectives:
 * $\left\{{\land, \lor}\right\}$: And and Or

is not functionally complete.

Proof
Let $v_T$ be the boolean interpretation that assigns $T$ to each propositional symbol.

Then it follows by the nature of the truth functions for $\land$ and $\lor$ that:


 * $v_T \left({\mathbf A}\right) = T$

for each WFF $\mathbf A$ comprising only $\land$ and $\lor$.

On the other hand:


 * $v_T \left({\neg p}\right) = F$

Therefore, $\neg p$ cannot be expressed in terms of $\land$ and $\lor$.

Hence, $\left\{{\land, \lor}\right\}$ is not functionally complete.