Mathematical Logic Spring 2004
We have seen that (T, T) must = F since otherwise, any repeated applications of ,
would continue to return T. Similarly (F, F) must = T. This makes (P, P) ~ ¬P. c.
Use this to conclude that | and are the only adequate binary connectives. Of the
16 possible binary connectives, there are only 4 satisfying the above ...