Sheffer stroke

The non-conjunction is a logical operation on two logical values. It produces a value of true, if — and only if — at least one of the propositions is false. Truth table The truth table of A \uparrow B is as follows. Logical equivalences The Sheffer stroke of P and Q is the negation of their conjunction By De Morgan's laws, this is also equivalent to the disjunction of the negations of P and Q ==Alternative notations and names==

Peirce was the first to show the functional completeness of non-conjunction (representing this as \overline{\curlywedge}) but did not publish his result. Peirce's editor added \overline{\curlywedge}) for non-disjunction. and non-disjunction in print at the first time and showed their functional completeness. In 1929, Łukasiewicz used D in Dpq for non-conjunction in his Polish notation. An alternative notation for non-conjunction is \uparrow. It is not clear who first introduced this notation, although the corresponding \downarrow for non-disjunction was used by Quine in 1940. ==History==

The stroke is named after Henry Maurice Sheffer, who in 1913 published a paper in the Transactions of the American Mathematical Society providing an axiomatization of Boolean algebras using the stroke, and proved its equivalence to a standard formulation thereof by Huntington employing the familiar operators of propositional logic (AND, OR, NOT). Because of self-duality of Boolean algebras, Sheffer's axioms are equally valid for either of the NAND or NOR operations in place of the stroke. Sheffer interpreted the stroke as a sign for nondisjunction (NOR) in his paper, mentioning non-conjunction only in a footnote and without a special sign for it. It was Jean Nicod who first used the stroke as a sign for non-conjunction (NAND) in a paper of 1917 and which has since become current practice. Russell and Whitehead used the Sheffer stroke in the 1927 second edition of Principia Mathematica and suggested it as a replacement for the "OR" and "NOT" operations of the first edition. Charles Sanders Peirce (1880) had discovered the functional completeness of NAND or NOR more than 30 years earlier, using the term ampheck (for 'cutting both ways'), but he never published his finding. Two years before Sheffer, also described the NAND and NOR operators and showed that the other Boolean operations could be expressed by it. ==Properties==

NAND is commutative but not associative, which means that P \uparrow Q \leftrightarrow Q \uparrow P but (P \uparrow Q) \uparrow R \not\leftrightarrow P \uparrow (Q \uparrow R). Functional completeness The Sheffer stroke, taken by itself, is a functionally complete set of connectives. This can be seen from the fact that NAND does not possess any of the following five properties, each of which is required to be absent from, and the absence of all of which is sufficient for, at least one member of a set of functionally complete operators: truth-preservation, falsity-preservation, linearity, monotonicity, self-duality. (An operator is truth-preserving if its value is truth whenever all of its arguments are truth, or falsity-preserving if its value is falsity whenever all of its arguments are falsity.) It can also be proved by first showing, with a truth table, that \neg A is truth-functionally equivalent to A \uparrow A. Then, since A \uparrow B is truth-functionally equivalent to \neg (A \land B), and A \lor B is equivalent to \neg(\neg A \land \neg B), the Sheffer stroke suffices to define the set of connectives \{\land, \lor, \neg\}, which is shown to be truth-functionally complete by the Disjunctive Normal Form Theorem. ==Other Boolean operations in terms of the Sheffer stroke==

Expressed in terms of NAND \uparrow, the usual operators of propositional logic are: ==See also==