The scheffer stroke (or nand) (notation: p|q) is the logical operator with the following truth table: p q p|q f t f given propositions p and q, show that each of the following propositions are logically equivalent to a proposition which uses only the scheffer stroke | (you might need to use multiple scheffer strokes): (1) ¬p (2) paq (3) p v q. the peirce arrow (or nor) (notation: p iq) is the logical operator with the following truth table: p q p4q тт f f t f given propositions p and q, show that the following propositions are logically equivalent to a proposition which uses only the peirce arrow f: (4) ¬p (5) рлq (6) pv q.