A few examples of sign relations and triadic relations may serve to illustrate the problem of their demarcation.
First, to clear up one point of notation, in writing there is no assumption on my part the relational domains are necessarily disjoint. They may intersect or even be identical, as Of course we rarely need to contemplate limiting cases of that type but I find it useful to keep them in our categorical catalogue. (Other writers will differ on that score.) On the other hand, we very often consider cases where as in the following two examples of sign relations discussed in Sign Relations • Examples.
We have the following data.
As I mentioned, those examples were deliberately constructed to be as simple as possible but they do exemplify many typical features of sign relations in general. Until the time my advisor asked me for cases of that order I had always contemplated formal languages with countable numbers of signs and never really thought about finite sign relations at all.
- Charles S. Peirce (1902), “Parts of Carnegie Application” (L 75), in Carolyn Eisele (ed., 1976), The New Elements of Mathematics by Charles S. Peirce, vol. 4, 13–73. Online.
- C.S. Peirce • On the Definition of Logic
- C.S. Peirce • Logic as Semiotic
- C.S. Peirce • Objective Logic