The binary connective \(\mid\) is called the Sheffer stroke, named for the American logic professor Henry Sheffer, who proved in 1913 that this single connective is the only one needed. The truth table for \(\mid\) is given here. Sheffer also coined the term "Boolean algebra," the topic of Chapter 8, where we will see that this truth table represents the NAND gate.

Show that every compound wff is equivalent to a wff using only the connective.

Transcribed Image Text:

A 41 BAB TTF T F T FFF FT F F T T