Suppose that the operator <++ (backwards arrow slash) is represented by the following truth-table:

		( <++ )
T	T	F
T	F	F
F	T	T
F	F	F

1.

(a) Represent {&} in terms of {, <++}.

(b) What, then, may we conclude about the truth-functional completeness of the set {, <++} and why?

2.

(a) Represent {} the falsum in terms of {<++} alone.

(b) What, then, may we conclude about the truth-functional completeness of the set {<++, } and why?

3.

Finally, represent {&} in terms of {<++} alone.

4.

How might one go about showing that the set {<++} is not truth-functionally complete on its own? Hint: Think of some set of truth-functors that cannot be represented by the set {<++} alone.

5.

Similarly, come up with some reason or hypothesis for thinking that the set {&, , }is not truth functionally complete.