To say that a relative term “imparts a relation” is to say that it conveys information about the space of tuples in a cartesian product, that is, it determines a particular subset of that space. When we study the combinations of relative terms, from the most elementary forms of composition to the most complex patterns of correlation, we are considering the ways that these constraints, determinations, and informations, as imparted by relative terms, are compounded in the formation of syntax.
Let us go back and look more carefully at just how it happens that Peirce’s adjacent terms and subjacent indices manage to impart their respective measures of information about relations. Consider the examples shown in Figures 7 and 8, where connecting lines of identity have been drawn between the corresponding occurrences of the subjacent marks of reference:
One way to approach the problem of “information fusion” in Peirce’s syntax is to soften the distinction between adjacent terms and subjacent signs and treat the types of constraints they separately signify more on a par with each other. To that purpose, let us consider a way of thinking about relational composition that emphasizes the set-theoretic constraints involved in the construction of a composite relation.
For example, given the relations and Table 9 and Figure 10 present two ways of picturing the constraints that are involved in constructing the relational composition
The way to read Table 9 is to imagine that you are playing a game that involves placing tokens on the squares of a board that is marked in just this way. The rules are that you have to place a single token on each marked square in the middle of the board in such a way that all of the indicated constraints are satisfied. That is, you have to place a token whose denomination is a value in the set on each of the squares marked and similarly for the squares marked and meanwhile leaving all of the blank squares empty. Furthermore, the tokens placed in each row and column have to obey the relational constraints that are indicated at the heads of the corresponding row and column. Thus, the two tokens from have to denote the very same value from and likewise for and while the pairs of tokens on the rows marked and are required to denote elements that are in the relations and respectively. The upshot is that when just this much is done, that is, when the and relations are satisfied, then the row marked will automatically bear the tokens of a pair of elements in the composite relation
Figure 10 shows a different way of viewing the same situation.