I’ve been too immersed in the Peirce List discussion of Robert Marty’s “Podium” paper to write much here — before I lose track of what I’ve been thinking the last several days I’ll need to ravel up my off-the-cuff remarks and pen them on the sleeves of this blog.
Helmut Raulien asked several questions about the composition, irreducibility, and reducibility of relations. For background on relation composition as Peirce originally treated it, I referred him to Peirce’s 1870 Logic Of Relatives, especially the section titled “The Signs for Multiplication”, along with my commentary linked below.
There is also this article:
For readers who want to skip to the chase for the quickest possible overview, the sorts of pictures floating through my head when I’m thinking about relational composition are the bipartite graph or “bigraph” pictures in the following section.
The ways in which relations are reducible or irreducible to simpler relations are covered in the following article.
The following set of articles, in order of increasing generality, may be useful on these scores, providing background and concrete examples.