On proving functional incompleteness in symbolic logic classes.
Francis Jeffry Pelletier, W. David Sharp · Notre Dame Journal of Formal Logic · 1988
/ 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