|
|
Finger Logic
|
|
|
Let us begin with elementary logic and let us do what children do when they learn to count. Use your fingers. Start with Logic Hands and with any two undivided totalities (A, B). Then put an A on the left thumb and a B on the right thumb. Now put one letter on each finger, T for True and F for False. Write the letters so that the four pairs of corresponding fingers will be in place and marked from left to right as follows: TT-index, TF-middle, FT-ring, and FF-little. Finger logic tells us that we have two thumbs (A, B) and four pairs of fingers (TT, TF, FT, FF). The next step is a big step. It is more abstract and it becomes very exact about a fundamental set of relations between the A and B in (A, B). In other words, right from the beginning this starts from what is relations-theory generated. This part of finger logic puts the focus on what are called the 16 binary connectives. There are 16 ways and only 16 ways that the two fingers, only the two fingers, within each of the four pairs can touch each other. Call a pair (T)rue when (T)ouching within a pair takes place; if not, (F)alse. For example, (FFFF) has no pairs touching, (TFFF) has only the two index fingers touching each other, and so forth, for all of the 16 ways. The subsets in this truth table (1 4 6 4 1) are equal to a line of coefficients taken from Pascal's triangle. The subsets start with one case for no pairs touching (FFFF) and they go all the way to one case for all four pairs touching (TTTT).
|
|
|
|