Flipstick Logic

FLIPSTICK LOGIC uses a special set of letter-shapes to symbolize the 16 binary connectives. These letter-shapes are subjected to a system of flips, rotations, and counterchanges, when Negation acts on (?A ?* ?B). (A,B) is for any two atomic sentences. (?) is for Negation (N) or its Absence (O). Substitute letter-shapes on the FLIPSTICK for the asterisk. Letter-shapes possess combinations of stems that act on (TT, TF, FF, FT); clockwise from the upper right. Each steam stands for (T)rue. (o) is FFFF; (d) is TFFF; (q) is FTFF; (p) is FFTF; (b) is FFFT; (h) is FTTT; (x) is TTTT; etc. So, (A o B) is (A contradiction B); (A x B) is (A tautology B); (A d B) is (A an__d__ B); etc.