 Any binary relational connection ⟨R, S, T⟩, as above, will be said to have conjunctive combinations on the left (right) if for any s0, s1 ∈ S there exists s2 ∈ S such that for all t ∈ T, R(s2, t) just in case R(s0, t) and R(s1, t) (respectively, for any t0, t1 ∈ T there exists t2 ∈ T such that for all s ∈ S, R(s, t2) just in case R(s, t0) and R(s, t1)); we call s2 (respectively, t2) a conjunctive combination of s0 and s1 (t0 and t1) in this case. Replacing the two “and”s after the words “just in case” by “or” gives the notion of disjunctive combinations on the left and right of ⟨R, S, T⟩. Both notions admit of an obvious generalization to the case in which {s0, s1} is replaced by an arbitrary subset S0 of S, and similarly on the T side. We write ∏L S0 and ∑L S0 for conjunctive and disjunctive combinations, respectively, in this case, and similarly on the right (with an “R” subscript), when we know either that such a combination is unique or that, while not unique, what is being said would be correct however a representative combination were chosen. The subscript is omitted when no confusion is likely. If, as above S0 = {s0, s1}, instead of writing ∏S0 (respectively, ∑S0), we write s0 ⋅ s1 (respectively, s0 + s1), and similarly on the right. To illustrate these concepts, consider the connection ⟨R, S, T⟩ with S some non-empty set, T its power set, and R the relation of membership (∈). There are conjunctive combinations and disjunctive combinations on the right, being intersections and unions respectively, but there are in general neither conjunctive nor disjunctive combinations on the left. Taking the former case, a conjunctive combination of s0 and s1, where these are distinct elements of S, would be an element of S belonging to precisely those subsets of S to which each of s0, s1, belongs—which is impossible since the unit set of this element—as with any unit set—contains only one element, and so not both of s0, s1. By analogy with the above definitions of conjunctive and disjunctive combinations we can also consider the existence of negative objects on the left and right of a relational connection, and note that again the set-theoretic example just given presents is with negative objects on the right (for S0 ⊆ S, the corresponding negative object is S ∖ S0), but not on the left (“no negative individuals”, as philosophers might put it, and the point would stand if we switched to the case in which T comprised properties—rather than sets—of individuals, reconstruing R accordingly). This absence of combinations simultaneously on the left and right of a relational connection is typical of non-degenerate cases, in that one can easily verify that if a relational connection has conjunctive combinations on the left and disjunctive combinations on the right, or vice versa, then it satisfies the following (rather strong) crossover condition: