32

OverviewVersionsHelp

Here you can see all page revisions and compare the changes have been made in each revision. Left column shows the page title and transcription in the selected revision, right column shows what have been changed. Unchanged text is highlighted in white, deleted text is highlighted in red, and inserted text is highlighted in green color.

2 revisions
Xander at Aug 25, 2020 07:48 PM

32

\pi \lambda
32

teridentity, or co-identity, or comidentity, or comitate identity, shown seperately in Fig. 6. If you can perceive, Reader, without long meditation, that comidentity involves something more than identity, you are certainly gifted with extraordinary logical acumen.
Yet, if there is nothing but identity in comidentity, why should Fig. 7 have a different meaning from Fig. 5?
Every graph has a definity valency, a definite number of pegs.
A number of dyads can only make a chain, and the compound will still be a dyad, as in Fig. 8., unless the two ends are joined making it a medad, as in Fig. 9.
But a number of triads can joiner so as to make a compound of any

32

\pi \lambda
32

teridentity, or co-identity, or comidentity, or comitate identity, shown seperately in Fig. 6. If you can perceive, Reader, without long meditation, that comidentity involves something more than identity, you are certainly gifted with extraordinary logical acumen.
Yet, if there is nothing but identity in comidentity, why should Fig. 7 have a different meaning from Fig. 5?
Every graph has a definity valency, a definite number of pegs.
A number of dyads can only make a chain, and the compound will still be a dyad, as in Fig. 8., unless the two ends are joined making it a medad, as in Fig. 9.
But a number of triads can joiner so as to make a compound of any