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

Peirce’s 1870 “Logic of Relatives”Comment 12.2

Let us make a few preliminary observations about the operation of logical involution which Peirce introduces in the following words.

I shall take involution in such a sense that x^y will denote everything which is an x for every individual of y.  Thus \mathit{l}^\mathrm{w} will be a lover of every woman.

(Peirce, CP 3.77)

In ordinary arithmetic the involution x^y, or the exponentiation of x to the power y, is the repeated application of the multiplier x for as many times as there are ones making up the exponent y.

In analogous fashion, the logical involution \mathit{l}^\mathrm{w} is the repeated application of the term \mathit{l} for as many times as there are individuals under the term \mathrm{w}.  On Peirce’s interpretive rules, the repeated applications of the base term \mathit{l} are distributed across the individuals of the exponent term \mathrm{w}.  In particular, the base term \mathit{l} is not applied successively in the manner that would give something on the order of “a lover of a lover of … a lover of a woman”.

By way of example, suppose a universe of discourse numbers among its elements just three women, \mathrm{W}^{\prime}, \mathrm{W}^{\prime\prime}, \mathrm{W}^{\prime\prime\prime}.  In Peirce’s notation the fact may be written as follows.

\mathrm{w} ~=~ \mathrm{W}^{\prime} ~+\!\!,~ \mathrm{W}^{\prime\prime} ~+\!\!,~ \mathrm{W}^{\prime\prime\prime}

In that case the following equation would hold.

\mathit{l}^\mathrm{w} ~=~ \mathit{l}^{(\mathrm{W}^{\prime} ~+\!\!,~ \mathrm{W}^{\prime\prime} ~+\!\!,~ \mathrm{W}^{\prime\prime\prime})} ~=~ (\mathit{l}\mathrm{W}^{\prime}), (\mathit{l}\mathrm{W}^{\prime\prime}), (\mathit{l}\mathrm{W}^{\prime\prime\prime})

The equation says a lover of every woman in the aggregate \mathrm{W}^{\prime} ~+\!\!,~ \mathrm{W}^{\prime\prime} ~+\!\!,~ \mathrm{W}^{\prime\prime\prime} is a lover of \mathrm{W}^{\prime} that is a lover of \mathrm{W}^{\prime\prime} that is a lover of \mathrm{W}^{\prime\prime\prime}.  In other words, a lover of every woman in the universe at hand is a lover of \mathrm{W}^{\prime} and a lover of \mathrm{W}^{\prime\prime} and a lover of \mathrm{W}^{\prime\prime\prime}.

The denotation of the term \mathit{l}^\mathrm{w} is a subset of X which may be obtained by the following procedure.  For each flag of the form L \star x with x \in W collect the subset \mathrm{proj}_1 (L \star x) of elements which appear as the first components of the pairs in L \star x and then take the intersection of all those subsets.  Putting it all together, we have the following equation.

Denotation Equation ℓ^w

It is instructive to examine the matrix representation of \mathit{l}^\mathrm{w} at this point, not the least because it effectively dispels the mystery of the name involution.  First, we make the following observation.  To say j is a lover of every woman is to say j loves k if k is a woman.  That can be rendered in symbols as follows.

j ~\text{loves}~ k ~\Leftarrow~ k ~\text{is a woman}

Reading the formula \mathit{l}^\mathrm{w} as “j loves k if k is a woman” highlights the operation of converse implication inherent in it, and this in turn reveals the analogy between implication and involution which accounts for the aptness of the latter name.

The operations defined by the formulas x^y = z ~\text{and}~ (x\!\Leftarrow\!y) = z ~\text{for}~ x, y, z in the boolean domain \mathbb{B} = \{ 0, 1 \} are tabulated as follows.

Involution ≅ Implication

It is clear the two operations are isomorphic, being effectively the same operation of type \mathbb{B} \times \mathbb{B} \to \mathbb{B}.  All that remains is to see how operations like these on values in \mathbb{B} induce the corresponding operations on sets and terms.

The term \mathit{l}^\mathrm{w} determines a selection of individuals from the universe of discourse X which may be computed via the corresponding operation on coefficient matrices.  If the terms \mathit{l} and \mathrm{w} are represented by the matrices \mathsf{L} = \mathrm{Mat}(\mathit{l}) and \mathsf{W} = \mathrm{Mat}(\mathrm{w}), respectively, then the operation on terms which produces the term \mathit{l}^\mathrm{w} must be represented by a corresponding operation on matrices, \mathsf{L}^\mathsf{W} = \mathrm{Mat}(\mathit{l})^{\mathrm{Mat}(\mathrm{w})}, which produces the matrix \mathrm{Mat}(\mathit{l}^\mathrm{w}).  In short, the involution operation on matrices must be defined in such a way that the following equation holds.

Matrix Involution L^W

The fact that \mathit{l}^\mathrm{w} denotes individuals in a subset of X tells us its matrix representation \mathsf{L}^\mathsf{W} is a 1‑dimensional array of coefficients in \mathbb{B} indexed by the elements of X.  The value of the matrix \mathsf{L}^\mathsf{W} at the index u in X is written (\mathsf{L}^\mathsf{W})_u and computed as follows.

Matrix Computation L^W

Resources

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

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 11 Comments

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

Peirce’s 1870 “Logic of Relatives”Comment 12.1

To get a better sense of why Peirce’s formulas in Selection 12 mean what they do, and to prepare the ground for understanding more complex relational expressions, it will help to assemble the following materials and definitions.

X is a set singled out in a particular discussion as the universe of discourse.

W \subseteq X is the monadic relation, or set, whose elements fall under the absolute term \mathrm{w} = \text{woman}.  The elements of W are referred to as the denotation or extension of the term \mathrm{w}.

L \subseteq X \times X is the dyadic relation associated with the relative term \mathit{l} = \text{lover of}\,\underline{~~~~}.

S \subseteq X \times X is the dyadic relation associated with the relative term \mathit{s} = \text{servant of}\,\underline{~~~~}.

\mathsf{W} = (\mathsf{W}_x) = \mathrm{Mat}(W) = \mathrm{Mat}(\mathrm{w}) is the 1-dimensional matrix representation of the set W and the term \mathrm{w}.

\mathsf{L} = (\mathsf{L}_{xy}) = \mathrm{Mat}(L) = \mathrm{Mat}(\mathit{l}) is the 2-dimensional matrix representation of the relation L and the relative term \mathit{l}.

\mathsf{S} = (\mathsf{S}_{xy}) = \mathrm{Mat}(S) = \mathrm{Mat}(\mathit{s}) is the 2-dimensional matrix representation of the relation S and the relative term \mathit{s}.

A few concepts from the article on Relation Theory, touched on again in Comment 11.7, will also be useful.

The local flags of the relation L are defined as follows.

\begin{array}{lll}  u \star L  & = & L_{u\,@\,1}  \\[6pt]  & = & \{ (u, x) \in L \}  \\[6pt]  & = & \text{ordered pairs in}~ L ~\text{with}~ u ~\text{in the 1st place}.  \\[9pt]  L \star v  & = & L_{v\,@\,2}  \\[6pt]  & = & \{ (x, v) \in L \}  \\[6pt]  & = & \text{ordered pairs in}~ L ~\text{with}~ v ~\text{in the 2nd place}.  \end{array}

The applications of the relation L are defined as follows.

\begin{array}{lll}  u \cdot L  & = & \mathrm{proj}_2 (u \star L)  \\[6pt]  & = & \{ x \in X : (u, x) \in L \}  \\[6pt]  & = & \text{loved by}~ u.  \\[9pt]  L \cdot v  & = & \mathrm{proj}_1 (L \star v)  \\[6pt]  & = & \{ x \in X : (x, v) \in L \}  \\[6pt]  & = & \text{lover of}~ v.  \end{array}

Resources

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

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 12 Comments

Peirce’s 1870 “Logic of Relatives” • Selection 12

On to the next part of §3. Application of the Algebraic Signs to Logic.

Peirce’s 1870 “Logic of Relatives”Selection 12

The Sign of Involution

I shall take involution in such a sense that x^y will denote everything which is an x for every individual of y.  Thus \mathit{l}^\mathrm{w} will be a lover of every woman.  Then (\mathit{s}^\mathit{l})^\mathrm{w} will denote whatever stands to every woman in the relation of servant of every lover of hers;  and \mathit{s}^{(\mathit{l}\mathrm{w})} will denote whatever is a servant of everything that is lover of a woman.  So that

(s^ℓ)^w = s^(ℓw)

(Peirce, CP 3.77)

References

  • Peirce, C.S. (1870), “Description of a Notation for the Logic of Relatives, Resulting from an Amplification of the Conceptions of Boole’s Calculus of Logic”, Memoirs of the American Academy of Arts and Sciences 9, 317–378, 26 January 1870.  Reprinted, Collected Papers 3.45–149, Chronological Edition 2, 359–429.  Online (1) (2) (3).
  • Peirce, C.S., Collected Papers of Charles Sanders Peirce, vols. 1–6, Charles Hartshorne and Paul Weiss (eds.), vols. 7–8, Arthur W. Burks (ed.), Harvard University Press, Cambridge, MA, 1931–1935, 1958.
  • Peirce, C.S., Writings of Charles S. Peirce : A Chronological Edition, Peirce Edition Project (eds.), Indiana University Press, Bloomington and Indianapolis, IN, 1981–.

Resources

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

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 15 Comments

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

Peirce’s 1870 “Logic of Relatives”Comment 11.24

We come to the last of Peirce’s observations about the “number of” function in CP 3.76.

NOF 4.4

It is to be observed that

[\mathit{1}] ~=~ 1.

Boole was the first to show this connection between logic and probabilities.  He was restricted, however, to absolute terms.  I do not remember having seen any extension of probability to relatives, except the ordinary theory of expectation.

Our logical multiplication, then, satisfies the essential conditions of multiplication, has a unity, has a conception similar to that of admitted multiplications, and contains numerical multiplication as a case under it.

(Peirce, CP 3.76 and CE 2, 376)

There are problems with the printing of text at this point.  To recall the conventions used in this transcription, the italic figure ``\mathit{1}" denotes the dyadic identity relation \mathit{1} while the antique figure ``\mathfrak{1}" denotes what Peirce otherwise defines as \mathit{1}_\infty = \text{something}.

Collected Papers CP 3 gives [\mathit{1}] = \mathfrak{1}, which does not make sense.  Chronological Edition CE 2 gives the 1’s in different styles of italics but reading the equation as [\mathit{1}] = 1 makes better sense if the latter “1” is the numeral denoting the natural number 1 and not the absolute term “1” denoting the universe of discourse.  The quantity [\mathit{1}] is defined as the average number of things related by the identity relation \mathit{1} to one individual, and so it makes sense that [\mathit{1}] = 1 \in \mathbb{N}, where \mathbb{N} is the set of non-negative integers \{ 0, 1, 2, \ldots \}.

With respect to the relative term ``\mathit{1}" in the syntactic domain S and the number 1 in the non-negative integers \mathbb{N} \subset \mathbb{R}, we have the following.

v(\mathit{1}) ~=~ [\mathit{1}] ~=~ 1.

At long last, then, the “number of” mapping v : S \to \mathbb{R} has another one of the properties required of an arrow from logical terms in S to real numbers in \mathbb{R}.

Resources

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

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 10 Comments

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

Peirce’s 1870 “Logic of Relatives”Comment 11.23

Peirce’s description of logical conjunction and conditional probability via the logic of relatives and the mathematics of relations is critical to understanding the relationship between logic and measurement, in effect, the qualitative and quantitative aspects of inquiry.  To root that connection firmly in mind, I will try to sum up as succinctly as possible, in more current notation, the lesson we ought to take away from Peirce’s last “number of” example, since I know the account I have given so far may appear to have wandered widely.

NOF 4.3

So if men are just as apt to be black as things in general,

[\mathrm{m,}][\mathrm{b}] ~=~ [\mathrm{m,}\mathrm{b}],

where the difference between [\mathrm{m}] and [\mathrm{m,}] must not be overlooked.

(Peirce, CP 3.76)

Viewed in different lights the formula [\mathrm{m,}\mathrm{b}] = [\mathrm{m,}][\mathrm{b}] presents itself as an aimed arrow, fair sampling, or statistical independence condition.  The concept of independence was illustrated in the previous installment by means of a case where independence fails.  The details of that counterexample are summarized below.

Othello Product M,B,
\text{Figure 54. Bigraph Product}~ M,B,

The condition that “men are just as apt to be black as things in general” is expressed in terms of conditional probabilities as \mathrm{P}(\mathrm{b}|\mathrm{m}) = \mathrm{P}(\mathrm{b}), which means that the probability of the event \mathrm{b} given the event \mathrm{m} is equal to the unconditional probability of the event \mathrm{b}.

In the Othello example it is enough to observe that \mathrm{P}(\mathrm{b}|\mathrm{m}) = \tfrac{1}{4} while \mathrm{P}(\mathrm{b}) = \tfrac{1}{7} in order to recognize the bias or dependency of the sampling map.

The reduction of a conditional probability to an absolute probability, as \mathrm{P}(A|Z) = \mathrm{P}(A), is one of the ways we come to recognize the condition of independence, \mathrm{P}(AZ) = \mathrm{P}(A)P(Z), via the definition of conditional probability, \mathrm{P}(A|Z) = \displaystyle{\mathrm{P}(AZ) \over \mathrm{P}(Z)}.

By way of recalling the derivation, the definition of conditional probability plus the independence condition yields the following sequence of equations.

\mathrm{P}(A|Z) = \displaystyle{\mathrm{P}(AZ) \over P(Z)} = \displaystyle{\mathrm{P}(A)\mathrm{P}(Z) \over \mathrm{P}(Z)} = \mathrm{P}(A).

As Hamlet discovered, there’s a lot to be learned from turning a crank.

Resources

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

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 10 Comments

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

Peirce’s 1870 “Logic of Relatives”Comment 11.22

Let’s look at that last example from a different angle.

NOF 4.3

So if men are just as apt to be black as things in general,

[\mathrm{m,}][\mathrm{b}] ~=~ [\mathrm{m,}\mathrm{b}],

where the difference between [\mathrm{m}] and [\mathrm{m,}] must not be overlooked.

(Peirce, CP 3.76)

Viewed in various lights the formula [\mathrm{m,}\mathrm{b}] = [\mathrm{m,}][\mathrm{b}] presents itself as an aimed arrow, fair sampling, or stochastic independence condition.

Peirce’s example assumes a universe of things in general encompassing the denotations of the absolute terms \mathrm{m} = \text{man} and \mathrm{b} = \text{black}.  That allows us to illustrate the case in relief, by returning to our earlier staging of Othello and examining the premiss that “men are just as apt to be black as things in general” within the frame of that empirical if fictional universe of discourse.

We have the following data.

\begin{array}{*{15}{l}}  \mathrm{b} & = & \mathrm{O}  \\[6pt]  \mathrm{m} & = &  \mathrm{C} & +\!\!, &  \mathrm{I} & +\!\!, &  \mathrm{J} & +\!\!, &  \mathrm{O}  \\[6pt]  \mathbf{1} & = &  \mathrm{B} & +\!\!, &  \mathrm{C} & +\!\!, &  \mathrm{D} & +\!\!, &  \mathrm{E} & +\!\!, &  \mathrm{I} & +\!\!, &  \mathrm{J} & +\!\!, &  \mathrm{O}  \\[12pt]  \mathrm{b,} & = & \mathrm{O\!:\!O}  \\[6pt]  \mathrm{m,} & = &  \mathrm{C\!:\!C} & +\!\!, &  \mathrm{I\!:\!I} & +\!\!, &  \mathrm{J\!:\!J} & +\!\!, &  \mathrm{O\!:\!O}  \\[6pt]  \mathbf{1,} & = &  \mathrm{B\!:\!B} & +\!\!, &  \mathrm{C\!:\!C} & +\!\!, &  \mathrm{D\!:\!D} & +\!\!, &  \mathrm{E\!:\!E} & +\!\!, &  \mathrm{I\!:\!I} & +\!\!, &  \mathrm{J\!:\!J} & +\!\!, &  \mathrm{O\!:\!O}  \end{array}

The fair sampling condition amounts to saying men are just as likely to be black as things in general are likely to be black.  In other words, men are a fair sample of things in general with respect to the predicate of being black.

On that condition the following equation holds.

[\mathrm{m,}\mathrm{b}] ~=~ [\mathrm{m,}][\mathrm{b}].

Assuming [\mathrm{b}] is not zero, the next equation follows.

[\mathrm{m,}] ~=~ \displaystyle{[\mathrm{m,}\mathrm{b}] \over [\mathrm{b}]}.

As before, it is convenient to represent the absolute term \mathrm{b} = \text{black} by means of the corresponding idempotent term \mathrm{b,} = \text{black that is}\,\underline{~~~~}. 

Let is next consider the bigraph for the following relational product.

\mathrm{m,}\mathrm{b} ~=~ \text{man that is black}.

We may represent that in the following equivalent form.

\mathrm{m,}\mathrm{b,} ~=~ \text{man that is black that is}\,\underline{~~~~}.

Othello Product M,B,
\text{Figure 53. Bigraph Product}~ M,B,

The facts of the matter in the Othello case are such that the following formula holds.

\mathrm{m,}\mathrm{b} ~=~ \mathrm{b}.

And that in turn is equivalent to each of the following statements.

\begin{matrix}  m \land b = b  \\[6pt]  \mathrm{b} \implies \mathrm{m}  \\[6pt]  \mathrm{b} ~-\!\!\!< \mathrm{m}  \end{matrix}

Those last implications puncture any notion of statistical independence for \mathrm{b} and \mathrm{m} in the universe of discourse at hand but it will repay us to explore the details of the case a little further.  Putting all the general formulas and particular facts together, we arrive at the following summation of the situation in the Othello case.

If the fair sampling condition were true, it would have the following consequence.

\displaystyle [\mathrm{m,}] ~=~ {[\mathrm{m,}\mathrm{b}] \over [\mathrm{b}]} ~=~ {[\mathrm{b}] \over [\mathrm{b}]} ~=~ \mathfrak{1}.

On the contrary, we have the following fact.

\displaystyle [\mathrm{m,}] ~=~ {[\mathrm{m,}\mathbf{1}] \over [\mathbf{1}]} ~=~ {[\mathrm{m}] \over [\mathbf{1}]} ~=~ {4 \over 7}.

In sum, it is not the case in the Othello example that “men are just as apt to be black as things in general”.

Expressed in terms of probabilities:

\mathrm{P}(\mathrm{m}) = \displaystyle{4 \over 7}   and   \mathrm{P}(\mathrm{b}) = \displaystyle{1 \over 7}.

If these were independent terms, we would have:

\mathrm{P}(\mathrm{m}\mathrm{b}) = \displaystyle{4 \over 49}.

In point of fact, however, we have:

\mathrm{P}(\mathrm{m}\mathrm{b}) = \mathrm{P}(\mathrm{b}) = \displaystyle{1 \over 7}.

Another way to see it is to observe that:

\mathrm{P}(\mathrm{b}|\mathrm{m}) = \displaystyle{1 \over 4}   while   \mathrm{P}(\mathrm{b}) = \displaystyle{1 \over 7}.

Resources

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

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 11 Comments

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

Peirce’s 1870 “Logic of Relatives”Comment 11.21

One more example and one more general observation and we’ll be caught up with our homework on Peirce’s “number of” function.

NOF 4.3

So if men are just as apt to be black as things in general,

[\mathrm{m,}][\mathrm{b}] ~=~ [\mathrm{m,}\mathrm{b}],

where the difference between [\mathrm{m}] and [\mathrm{m,}] must not be overlooked.

(Peirce, CP 3.76)

The protasis, men are just as apt to be black as things in general, is elliptic in structure and presents us with a potential ambiguity.  If we had no further clue to its meaning, it might be read as either one of the following statements.

  1. Men are just as apt to be black as things in general are apt to be black.
  2. Men are just as apt to be black as men are apt to be things in general.

The second interpretation, if grammatical, is pointless to state, since it equates a proper contingency with an absolute certainty.  So I think it is safe to assume the following paraphrase of what Peirce intends.

  • Men are just as likely to be black as things in general are likely to be black.

Stated in terms of conditional probability, we have the following equation.

\mathrm{P}(\mathrm{b}|\mathrm{m}) ~=~ \mathrm{P}(\mathrm{b}).

From the definition of conditional probability:

\mathrm{P}(\mathrm{b}|\mathrm{m}) ~=~ \displaystyle{\mathrm{P}(\mathrm{b}\mathrm{m}) \over \mathrm{P}(\mathrm{m})}.

Equivalently:

\mathrm{P}(\mathrm{b}\mathrm{m}) ~=~ \mathrm{P}(\mathrm{b}|\mathrm{m})\mathrm{P}(\mathrm{m}).

Taking everything together, we have the following result.

\mathrm{P}(\mathrm{b}\mathrm{m}) ~=~ \mathrm{P}(\mathrm{b}|\mathrm{m})\mathrm{P}(\mathrm{m}) ~=~ \mathrm{P}(\mathrm{b})\mathrm{P}(\mathrm{m}).

That, of course, is the definition of independent events, as applied to the event of being Black and the event of being a Man.  We may take that as the most likely reading of Peirce’s statement about frequencies:

[\mathrm{m,}\mathrm{b}] ~=~ [\mathrm{m,}][\mathrm{b}].

The terms of that equation can be normalized to produce the corresponding statement about probabilities.

\mathrm{P}(\mathrm{m}\mathrm{b}) ~=~ \mathrm{P}(\mathrm{m})\mathrm{P}(\mathrm{b}).

Let’s see if that reading checks out.

Let N be the number of things in general.  Expressed in Peirce’s notation we have the equation [\mathbf{1}] = N.  On the assumption that \mathrm{m} and \mathrm{b} are associated with independent events, we obtain the following sequence of equations.

\begin{array}{lll}  [\mathrm{m,} \mathrm{b}] & = & \mathrm{P}(\mathrm{m}\mathrm{b}) N  \\[6pt]  & = & \mathrm{P}(\mathrm{m}) \mathrm{P}(\mathrm{b}) N  \\[6pt]  & = & \mathrm{P}(\mathrm{m}) [\mathrm{b}]  \\[6pt]  & = & [\mathrm{m,}] [\mathrm{b}].  \end{array}

As a result, we have to interpret [\mathrm{m,}] = “the average number of men per things in general” as \mathrm{P}(\mathrm{m}) = “the probability of a thing in general being a man”.  That seems to make sense.

Resources

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

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 9 Comments

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

Peirce’s 1870 “Logic of Relatives”Comment 11.20

We come to the last of Peirce’s statements about the “number of” function, first quoted in Selection 11 and again with the whole set in Comment 11.2.

NOF 4.1

The conception of multiplication we have adopted is that of the application of one relation to another.  […]

Even ordinary numerical multiplication involves the same idea, for 2 \times 3 is a pair of triplets, and 3 \times 2 is a triplet of pairs, where “triplet of” and “pair of” are evidently relatives.

If we have an equation of the form

xy ~=~ z

and there are just as many x’s per y as there are, per things, things of the universe, then we have also the arithmetical equation,

[x][y] ~=~ [z].

(Peirce, CP 3.76)

Peirce here observes what may be called a contingent morphism.  On a condition he gives, the mapping of logical terms to their corresponding numbers preserves the multiplication of relative terms after the fashion of the following formula.

v(xy) = v(x) v(y).

Equivalently:

[xy] = [x][y].

The condition for this to hold is expressed by Peirce in the following manner.

There are just as many x’s per y as there are, per things, things of the universe.

Peirce’s phrasing on this point is admittedly hard to parse but if we stick with his story to the end I think we can see what he’s driving at.

NOF 4.2

For instance, if our universe is perfect men, and there are as many teeth to a Frenchman (perfect understood) as there are to any one of the universe, then

[\mathit{t}][\mathrm{f}] ~=~ [\mathit{t}\mathrm{f}]

holds arithmetically.  (Peirce, CP 3.76).

Now that is something we can sink our teeth into and trace the bigraph representation of the situation.  It will help to recall our first examination of the “tooth of” relation and to adjust the picture we sketched of it on that occasion.

Transcribing Peirce’s example:

\begin{array}{ll}  \text{Let}  &  \mathrm{m} ~=~ \text{man}  \\[8pt]  \text{and}  &  \mathit{t} ~=~ \text{tooth of}\,\underline{~~~~}.  \\[8pt]  \text{Then} &  v(\mathit{t}) ~=~ [\mathit{t}] ~=~ \displaystyle\frac{[\mathit{t}\mathrm{m}]}{[\mathrm{m}]}.  \end{array}

That is to say, the number of the relative term “tooth of” is equal to the number of teeth of humans divided by the number of humans.  In a universe of perfect human dentition this gives a quotient of 32.

The dyadic relative term \mathit{t} determines a dyadic relation T \subseteq X \times Y, where X contains all the teeth and Y contains all the people under discussion.

To make the case as simple as possible and still cover the point, suppose there are just four people in our universe of discourse and just two of them are French.  The bigraph product below shows the pertinent facts of the case.

Bigraph Product T ◦ F
\text{Figure 52. Bigraph Product}~ T \circ F

In this picture the order of relational composition flows down the page.  For convenience in composing relations, the absolute term \mathrm{f} = \text{Frenchman} is inflected by the comma functor to form the dyadic relative term \mathrm{f,} = \text{Frenchman that is}\,\underline{~~~~}, which in turn determines the idempotent representation of Frenchmen as a subset of mankind, F \subseteq Y \times Y.

By way of a legend for the Figure, we have the following data.

\begin{array}{lllr}  \mathrm{m} & = &  \mathrm{J} ~+\!\!,~ \mathrm{K} ~+\!\!,~ \mathrm{L} ~+\!\!,~ \mathrm{M} \qquad = & \mathbf{1}  \\[6pt]  \mathrm{f} & = & \mathrm{K} ~+\!\!,~ \mathrm{M}  \\[6pt]  \mathrm{f,} & = & \mathrm{K}\!:\!\mathrm{K} ~+\!\!,~ \mathrm{M}\!:\!\mathrm{M}  \\[6pt]  \mathit{t} & = & (T_{001} ~+\!\!,~ \dots ~+\!\!,~ T_{032}):J & ~+\!\!,  \\[6pt]  & & (T_{033} ~+\!\!,~ \dots ~+\!\!,~ T_{064}):K & ~+\!\!,  \\[6pt]  & & (T_{065} ~+\!\!,~ \dots ~+\!\!,~ T_{096}):L & ~+\!\!,  \\[6pt]  & & (T_{097} ~+\!\!,~ \dots ~+\!\!,~ T_{128}):M  \end{array}

We can use this picture to make sense of Peirce’s statement, repeated below.

NOF 4.2

For instance, if our universe is perfect men, and there are as many teeth to a Frenchman (perfect understood) as there are to any one of the universe, then

[\mathit{t}][\mathrm{f}] ~=~ [\mathit{t}\mathrm{f}]

holds arithmetically.  (Peirce, CP 3.76)

In statistical terms, Peirce is saying this:  If the population of Frenchmen is a fair sample of the general population with regard to the factor of dentition, then the morphic equation,

[\mathit{t}\mathrm{f}] ~=~ [\mathit{t}][\mathrm{f}],

whose transpose gives the equation,

[\mathit{t}] ~=~ \displaystyle\frac{[\mathit{t}\mathrm{f}]}{[\mathrm{f}]},

is every bit as true as the defining equation in this circumstance, namely,

[\mathit{t}] ~=~ \displaystyle\frac{[\mathit{t}\mathrm{m}]}{[\mathrm{m}]}.

Resources

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

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 9 Comments

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

Peirce’s 1870 “Logic of Relatives”Comment 11.19

Up to this point in the 1870 Logic of Relatives, Peirce has introduced the “number of” function on logical terms, v : S \to \mathbb{R} such that v : s \mapsto [s], and discussed the extent to which its use as a measure satisfies the relevant measure-theoretic principles, beginning with the following two.

  1. The “number of” map exhibits a certain type of uniformity property, where the value of the measure on a uniformly qualified population is in fact actualized by each member of the population.
  2. The “number of” map satisfies an order morphism principle, where the partial order of logical terms under implication or inclusion is reflected to a moderate degree by the linear order of their measures.

In Selection 4 Peirce takes up the action of the “number of” function on two types of more or less additive operations we normally consider in logic.

NOF 3.1

It is plain that both the regular non-invertible addition and the invertible addition satisfy the absolute conditions.  (CP 3.67).

Peirce uses the sign “+\!\!,” to indicate what he calls the “regular non-invertible addition”, corresponding to the inclusive disjunction of logical terms or the union of their extensions as sets.

Peirce uses the sign “+” to indicate what he calls the “invertible addition”, corresponding to the exclusive disjunction of logical terms or the symmetric difference of their extensions as sets.

NOF 3.2

But the notation has other recommendations.  The conception of taking together involved in these processes is strongly analogous to that of summation, the sum of 2 and 5, for example, being the number of a collection which consists of a collection of two and a collection of five.  (CP 3.67).

A full interpretation of the above remark would require us to pick up the precise technical sense in which Peirce is using the word collection and that would take us back to his logical reconstruction of certain aspects of number theory, all of which I am putting off to another time, but it is still possible to get a rough sense of what he is saying relative to the present frame of discussion.

The “number of” map v : S \to \mathbb{R} evidently induces some sort of morphism with respect to logical sums.  If this were true in the strictest sense, we could remove the question marks from the following dubious equations.

v(x ~+\!\!,~ y) ~ \overset{?}{=} ~ v(x) ~+~ v(y)

Equivalently:

[x ~+\!\!,~ y] ~ \overset{?}{=} ~ [x] ~+~ [y]

Of course, things are not quite that simple when it comes to inclusive disjunctions and set‑theoretic unions, so it is usual to introduce the concept of a sub‑additive measure to describe the principle that does hold here, namely, the following.

v(x ~+\!\!,~ y) ~ \le ~ v(x) ~+~ v(y)

Equivalently:

[x ~+\!\!,~ y] ~ \le ~ [x] ~+~ [y]

That is why Peirce trims his discussion of the point with the following hedge.

NOF 3.3

Any logical equation or inequality in which no operation but addition is involved may be converted into a numerical equation or inequality by substituting the numbers of the several terms for the terms themselves — provided all the terms summed are mutually exclusive.  (CP 3.67).

Finally, a morphism with respect to addition, even a contingently qualified one, must do the right thing on behalf of the additive identity element, as follows.

NOF 3.4

Addition being taken in this sense, nothing is to be denoted by zero, for then

x ~+\!\!,~ 0 ~=~ x

whatever is denoted by x;  and this is the definition of zero.  This interpretation is given by Boole, and is very neat, on account of the resemblance between the ordinary conception of zero and that of nothing, and because we shall thus have

[0] ~=~ 0.

(Peirce, CP 3.67)

With respect to the nullity 0 in S and the number 0 in \mathbb{R}, we have the following equation.

v(0) ~=~ [0] ~=~ 0.

In sum, therefore, it can be said:   A measure only serves which also preserves a due respect for the function of a vacuum in nature.

Resources

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

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 10 Comments

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

Peirce’s 1870 “Logic of Relatives”Comment 11.18

An order-preserving map is a special case of a structure-preserving map and the idea of preserving structure, as used in mathematics, means preserving some but not necessarily all the structure of the source domain in the transition to the target domain.  In that vein, we may speak of structure preservation in measure, the suggestion being that a property able to be qualified in manner is potentially able to be quantified in degree, admitting answers to questions like, “How structure-preserving is it?”

Let’s see how this applies to Peirce’s “number of” function v : S \to \mathbb{R}.  Let ``-\!\!\!<\!" denote the implication relation on logical terms, let ``\!\le\!" denote the less than or equal to relation on real numbers, and let x, y be any pair of absolute terms in the syntactic domain S.  Then we observe the following relationships.

\begin{array}{lll}  x ~-\!\!\!< y & \Rightarrow & v(x) \le v(y)  \end{array}

Equivalently:

\begin{array}{lll}  x ~-\!\!\!< y & \Rightarrow & [x] \le [y]  \end{array}

Nowhere near the number of logical distinctions on the left sides of the implication arrows are typically preserved as one passes to the linear orderings of real numbers on their right sides but that is not required in order to call the map v : S \to \mathbb{R} order-preserving, or what is known as an order morphism.

Resources

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

Posted in C.S. Peirce, Logic, Logic of Relatives, Logical Graphs, Mathematics, Relation Theory, Visualization | Tagged , , , , , , | 9 Comments