We saw in class the Conditional Identity, namely that p → q ≡ ¬p∨q. We might wonder then why it is necessary to even include → as an operator since it’s redundant. Well we include it because it is simpler to write and it is a very common operation in logic. However, this then might lead to the question of how many of our operators are redundant? Without → then we are down to 4 operators: ¬, ∧, ∨, and ⊕. Can we show we need even fewer?