Changes

|}

|}

This example illustrates the way that Peirce analyzes the logical conjunction, we might even say the "parallel conjunction", of a couple of 2-adic relatives in terms of the comma extension and the same style of composition that we saw in the last example, that is, according to a pattern of anaphora that invokes the teridentity relation.

This example illustrates the way that Peirce analyzes the logical conjunction, we might even say the ''parallel conjunction'', of a pair of 2-adic relatives in terms of the comma extension and the same style of composition that we saw in the last example, that is, according to a pattern of anaphora that invokes the teridentity relation.

If we lay out this analysis of conjunction on the spreadsheet model of relational composition, the gist of it is the diagonal extension of a 2-adic "loving" relation ''L'' ⊆ ''X'' × ''Y'' to the corresponding 3-adic "loving and being" relation ''L'', ⊆ ''X'' × ''X'' × ''Y'', which is then composed in a specific way with a 2-adic "serving" relation ''S'' ⊆ ''X'' × ''Y'', so as to determine the 2-adic relation ''L'',''S'' ⊆ ''X'' × ''Y''.  Table 15 schematizes the associated constraints on tuples.

If we lay out this analysis of conjunction on the spreadsheet model of relational composition, the gist of it is the diagonal extension of a 2-adic ''loving'' relation <math>L \subseteq X \times Y</math> to the corresponding 3-adic ''being and loving'' relation <math>L \subseteq X \times X \times Y,</math> which is then composed in a specific way with a 2-adic ''serving'' relation <math>S \subseteq X \times Y,</math> so as to determine the 2-adic relation <math>L,\!S \subseteq X \times Y.</math> Table&nbsp;15 schematizes the associated constraints on tuples.

{| align="center" cellspacing="6" width="90%"

{| align="center" cellspacing="6" width="90%"