Key points are not available for this paper at this time.
/ Introduction: Functional completeness A set of truth-functional connectives is said to be functionally complete 1 if every truth function can be represented by some formula which uses connectives only from that set. In the first semester of a sequence of introductory symbolic logic courses, one normally
Pelletier et al. (Tue,) studied this question.