Peirce’s 1870 “Logic of Relatives” • Comment 8.6

Peirce’s 1870 “Logic of Relatives”Comment 8.6

The foregoing has hopefully filled in enough background that we can begin to make sense of the more mysterious parts of CP 3.73.

The Signs for Multiplication (cont.)

Thus far, we have considered the multiplication of relative terms only.  Since our conception of multiplication is the application of a relation, we can only multiply absolute terms by considering them as relatives.

Now the absolute term “man” is really exactly equivalent to the relative term “man that is ──”, and so with any other.  I shall write a comma after any absolute term to show that it is so regarded as a relative term.

Then “man that is black” will be written:

\mathrm{m},\!\mathrm{b}.

(CP 3.73)

In any system where elements are organized according to types there tend to be any number of ways in which elements of one type are naturally associated with elements of another type.  If the association is anything like a logical equivalence, but with the first type being lower and the second type being higher in some sense, then one may speak of a semantic ascent from the lower to the higher type.

For example, it is common in mathematics to associate an element a of a set A with the constant function f_a : X \to A which has f_a (x) = a for all x in X, where X is an arbitrary set which is fixed in the context of discussion.  Indeed, the correspondence is so close that one often uses the same name {}^{\backprime\backprime} a {}^{\prime\prime} to denote both the element a in A and the function a = f_a : X \to A, relying on context or an explicit type indication to tell them apart.

For another example, we have the tacit extension of a k-place relation L \subseteq X_1 \times \ldots \times X_k to a (k+1)-place relation L' \subseteq X_1 \times \ldots \times X_{k+1} which we get by letting L' = L \times X_{k+1}, that is, by maintaining the constraints of L on the first k variables and letting the last variable wander freely.

What we have here, if I understand Peirce correctly, is another such type of natural extension, sometimes called the diagonal extension.  This extension associates a k-adic relative or a k-adic relation, counting the absolute term and the set whose elements it denotes as the cases for k = 0, with a series of relatives and relations of higher adicities.

A few examples will suffice to anchor these ideas.

Absolute Terms

\begin{array}{*{11}{c}}  \mathrm{m} & = &  \text{man} & = &  \mathrm{C} & +\!\!, &  \mathrm{I} & +\!\!, &  \mathrm{J} & +\!\!, &  \mathrm{O}  \\[6pt]  \mathrm{n} & = &  \text{noble} & = &  \mathrm{C} & +\!\!, &  \mathrm{D} & +\!\!, &  \mathrm{O}  \\[6pt]  \mathrm{w} & = &  \text{woman} & = &  \mathrm{B} & +\!\!, &  \mathrm{D} & +\!\!, &  \mathrm{E}  \end{array}

Diagonal Extensions

\begin{array}{*{11}{c}}  \mathrm{m,} & = &  \text{man that is}\, \underline{~~~~} & = &  \mathrm{C\!:\!C} & +\!\!, &  \mathrm{I\!:\!I} & +\!\!, &  \mathrm{J\!:\!J} & +\!\!, &  \mathrm{O\!:\!O}  \\[6pt]  \mathrm{n,} & = &  \text{noble that is}\, \underline{~~~~} & = &  \mathrm{C\!:\!C} & +\!\!, &  \mathrm{D\!:\!D} & +\!\!, &  \mathrm{O\!:\!O}  \\[6pt]  \mathrm{w,} & = &  \text{woman that is}\, \underline{~~~~} & = &  \mathrm{B\!:\!B} & +\!\!, &  \mathrm{D\!:\!D} & +\!\!, &  \mathrm{E\!:\!E}  \end{array}

Sample Products

\begin{array}{lll}  \mathrm{m},\!\mathrm{n} & = & \text{man that is a noble} \\[6pt]  & = &  (\mathrm{C\!:\!C} ~+\!\!,~ \mathrm{I\!:\!I} ~+\!\!,~ \mathrm{J\!:\!J} ~+\!\!,~ \mathrm{O\!:\!O}) \\  & &  \times \\  & &  (\mathrm{C} ~+\!\!,~ \mathrm{D} ~+\!\!,~ \mathrm{O}) \\[6pt]  & = &  \mathrm{C} ~+\!\!,~ \mathrm{O}  \end{array}

\begin{array}{lll}  \mathrm{n},\!\mathrm{m} & = & \text{noble that is a man} \\[6pt]  & = &  (\mathrm{C\!:\!C} ~+\!\!,~ \mathrm{D\!:\!D} ~+\!\!,~ \mathrm{O\!:\!O}) \\  & &  \times \\  & &  (\mathrm{C} ~+\!\!,~ \mathrm{I} ~+\!\!,~ \mathrm{J} ~+\!\!,~ \mathrm{O}) \\[6pt]  & = &  \mathrm{C} ~+\!\!,~ \mathrm{O}  \end{array}

\begin{array}{lll}  \mathrm{w},\!\mathrm{n} & = & \text{woman that is a noble} \\[6pt]  & = &  (\mathrm{B\!:\!B} ~+\!\!,~ \mathrm{D\!:\!D} ~+\!\!,~ \mathrm{E\!:\!E}) \\  & &  \times \\  & &  (\mathrm{C} ~+\!\!,~ \mathrm{D} ~+\!\!,~ \mathrm{O}) \\[6pt]  & = &  \mathrm{D}  \end{array}

\begin{array}{lll}  \mathrm{n},\!\mathrm{w} & = & \text{noble that is a woman} \\[6pt]  & = &  (\mathrm{C\!:\!C} ~+\!\!,~ \mathrm{D\!:\!D} ~+\!\!,~ \mathrm{O\!:\!O}) \\  & &  \times \\  & &  (\mathrm{B} ~+\!\!,~ \mathrm{D} ~+\!\!,~ \mathrm{E}) \\[6pt]  & = &  \mathrm{D}  \end{array}

Resources

cc: CyberneticsOntolog ForumStructural ModelingSystems Science
cc: FB | Peirce MattersLaws of Form • Peirce List (1) (2) (3) (4) (5) (6) (7)

This entry was posted in C.S. Peirce, Logic, Logic of Relatives, Logical Matrices, Mathematics, Relation Theory, Visualization and tagged , , , , , , . Bookmark the permalink.

5 Responses to Peirce’s 1870 “Logic of Relatives” • Comment 8.6

  1. Pingback: Survey of Relation Theory • 3 | Inquiry Into Inquiry

  2. Pingback: Peirce’s 1870 “Logic Of Relatives” • Overview | Inquiry Into Inquiry

  3. Pingback: Peirce’s 1870 “Logic Of Relatives” • Comment 1 | Inquiry Into Inquiry

  4. Pingback: Survey of Relation Theory • 4 | Inquiry Into Inquiry

  5. Pingback: Survey of Relation Theory • 5 | Inquiry Into Inquiry

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.