Polarities (Part 4)

In Part 2, I explained some stuff you can do with graphs whose edges are labeled by elements of a rig. Remember, a rig is like a ring, but it might not have negatives. A great example is the boolean rig, whose elements are truth values:

The addition in this rig is ‘or’ and the multiplication is ‘and’.

So what’s the point? If we have a graph with edges labeled by booleans, we can use them to describe whether one vertex affects another. For example:

Here directly affects because the fir...