  Methods available for the axiomatization of arbitrary finite-valued logics
can be applied to obtain sound and complete intelim rules for all
truth-functional connectives of classical logic including the Sheffer stroke
(NAND) and Peirce's arrow (NOR). The restriction to a single conclusion in
standard systems of natural deduction requires the introduction of additional
rules to make the resulting systems complete; these rules are nevertheless
still simple and correspond straightforwardly to the classical absurdity rule.
Omitting these rules results in systems for intuitionistic versions of the
connectives in question.
