Up to this point in the 1870 Logic of Relatives, Peirce has introduced the “number of” function on logical terms and discussed the extent to which its use as a measure, 
![v : s \mapsto [s],](https://s0.wp.com/latex.php?latex=v+%3A+s+%5Cmapsto+%5Bs%5D%2C&bg=ffffff&fg=000000&s=1&c=20201002)
- The “number of” map exhibits a certain type of uniformity property, whereby the value of the measure on a uniformly qualified population is in fact actualized by each member of the population.
- The “number of” map satisfies an order morphism principle, whereby the illative partial ordering of logical terms is reflected to a degree by the arithmetical linear ordering of their measures.
Peirce next takes up the action of the “number of” map on the two types of, loosely speaking, additive operations that 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.
(Peirce, CP 3.67)
The sign 
The sign 
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 
(Peirce, CP 3.67)
A full interpretation of this remark will require us to pick up the precise technical sense in which Peirce is using the word collection, and that will 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’s saying relative to the present frame of discussion.
The “number of” map
Equivalently:
![\begin{matrix} ? & [x ~+\!\!,~ y] & = & [x] ~+~ [y] & ? \end{matrix}](https://s0.wp.com/latex.php?latex=%5Cbegin%7Bmatrix%7D++%3F+%26+%5Bx+%7E%2B%5C%21%5C%21%2C%7E+y%5D+%26+%3D+%26+%5Bx%5D+%7E%2B%7E+%5By%5D+%26+%3F++%5Cend%7Bmatrix%7D&bg=ffffff&fg=000000&s=1&c=20201002)
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:
Equivalently:
![\begin{matrix} [x ~+\!\!,~ y] & \le & [x] ~+~ [y] \end{matrix}](https://s0.wp.com/latex.php?latex=%5Cbegin%7Bmatrix%7D++%5Bx+%7E%2B%5C%21%5C%21%2C%7E+y%5D+%26+%5Cle+%26+%5Bx%5D+%7E%2B%7E+%5By%5D++%5Cend%7Bmatrix%7D&bg=ffffff&fg=000000&s=1&c=20201002)
This is why Peirce trims his discussion of this 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.
(Peirce, 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:
NOF 3.4
Addition being taken in this sense, nothing is to be denoted by zero, for then
whatever is denoted by 
![[0] ~=~ 0.](https://s0.wp.com/latex.php?latex=%5B0%5D+%7E%3D%7E+0.&bg=ffffff&fg=000000&s=1&c=20201002)
(Peirce, CP 3.67)
With respect to the nullity 
![v(0) ~=~ [0] ~=~ 0.](https://s0.wp.com/latex.php?latex=v%280%29+%7E%3D%7E+%5B0%5D+%7E%3D%7E+0.&bg=ffffff&fg=000000&s=1&c=20201002)
In sum, therefore, it can be said: It also serves that only preserves a due respect for the function of a vacuum in nature.
Pingback: Survey of Relation Theory • 3 | Inquiry Into Inquiry
Pingback: Peirce’s 1870 “Logic Of Relatives” • Overview | Inquiry Into Inquiry
Pingback: Peirce’s 1870 “Logic Of Relatives” • Comment 1 | Inquiry Into Inquiry
Pingback: Survey of Relation Theory • 4 | Inquiry Into Inquiry