|
Note. The intended forms of the Tables are visible only in the Page Image view.
A semiotic equivalence relation (SER) is a type of equivalence relation that arises in the analysis of sign relations. Any equivalence relation is closely associated with a corresponding set of equivalence classes that partition the underlying set of elements, commonly called the domain or the space of the relation. In the case of a
SER, the equivalence classes are called semiotic equivalence classes (SEC's) and the partition is called a semiotic partition (SEP).
Tables 1 and 2 list the triples of two finite relations, $L_{\mathrm{A}}$ and $L_{\mathrm{B}}$ , that are introduced in the entries on triadic relations and sign relations as examples of both those concepts.
| Table 1. Sign Relation $L_{\mathrm{A}}$ |
|
Table 2. Sign Relation $L_{\mathrm{B}}$ |
| Object |
Sign |
Interpretant |
|
Object |
Sign |
Interpretant |
| $\mathrm{A}$ |
$\mathrm{``A"}$ |
$\mathrm{``A"}$ |
|
$\mathrm{A}$ |
$\mathrm{``A"}$ |
$\mathrm{``A"}$ |
| $\mathrm{A}$ |
$\mathrm{``A"}$ |
$\mathrm{``i"}$ |
|
$\mathrm{A}$ |
$\mathrm{``A"}$ |
$\mathrm{``u"}$ |
| $\mathrm{A}$ |
$\mathrm{``i"}$ |
$\mathrm{``A"}$ |
|
$\mathrm{A}$ |
$\mathrm{``u"}$ |
$\mathrm{``A"}$ |
| $\mathrm{A}$ |
$\mathrm{``i"}$ |
$\mathrm{``i"}$ |
|
$\mathrm{A}$ |
$\mathrm{``u"}$ |
$\mathrm{``u"}$ |
| $\mathrm{B}$ |
$\mathrm{``B"}$ |
$\mathrm{``B"}$ |
|
$\mathrm{B}$ |
$\mathrm{``B"}$ |
$\mathrm{``B"}$ |
| $\mathrm{B}$ |
$\mathrm{``B"}$ |
$\mathrm{``u"}$ |
|
$\mathrm{B}$ |
$\mathrm{``B"}$ |
$\mathrm{``i"}$ |
| $\mathrm{B}$ |
$\mathrm{``u"}$ |
$\mathrm{``B"}$ |
|
$\mathrm{B}$ |
$\mathrm{``i"}$ |
$\mathrm{``B"}$ |
| $\mathrm{B}$ |
$\mathrm{``u"}$ |
$\mathrm{``u"}$ |
|
$\mathrm{B}$ |
$\mathrm{``i"}$ |
$\mathrm{``i"}$ |
| |
|
|
|
|
|
|
The sign relations $L_{\mathrm{A}}$ and $L_{\mathrm{B}}$ have many interesting properties that are not possessed by sign relations in general. Some of these properties have to do with the relation between signs and their interpretant signs, as reflected in the projections of the sign relations $L_{\mathrm{A}}$ and $L_{\mathrm{B}}$ on the $SI$ -plane, notated as $\operatorname{proj}_{SI}L_{\mathrm{A}}$ and $\operatorname{proj}_{SI}L_{\mathrm{B}}$ , respectively. The dyadic relations on $S \times I$
that are induced by these projections are also referred to as connotative components of the corresponding sign relations, notated as $\operatorname{Con}(L_{\mathrm{A}})$ and $\operatorname{Con}(L_{\mathrm{B}})$ , respectively. The discussion of these properties is made a little easier by using the following abbreviations.
- $\mathrm{A}_{SI} := \operatorname{Con}(L_{\mathrm{A}}) := \operatorname{proj}_{SI}L_{\mathrm{A}}.$
- $\mathrm{B}_{SI} := \operatorname{Con}(L_{\mathrm{B}}) := \operatorname{proj}_{SI}L_{\mathrm{B}}.$
Tables 3 and 4 exhibit the connotative components of $L_{\mathrm{A}}$ and $L_{\mathrm{B}}$ , respectively.
| Table 3. $\mathrm{A}_{SI}$ |
|
Table 4. $\mathrm{B}_{SI}$ |
| Sign |
Interpretant |
|
Sign |
Interpretant |
| $\mathrm{``A"}$ |
$\mathrm{``A"}$ |
|
$\mathrm{``A"}$ |
$\mathrm{``A"}$ |
| $\mathrm{``A"}$ |
$\mathrm{``i"}$ |
|
$\mathrm{``A"}$ |
$\mathrm{``u"}$ |
| $\mathrm{``i"}$ |
$\mathrm{``A"}$ |
|
$\mathrm{``u"}$ |
$\mathrm{``A"}$ |
| $\mathrm{``i"}$ |
$\mathrm{``i"}$ |
|
$\mathrm{``u"}$ |
$\mathrm{``u"}$ |
| $\mathrm{``B"}$ |
$\mathrm{``B"}$ |
|
$\mathrm{``B"}$ |
$\mathrm{``B"}$ |
| $\mathrm{``B"}$ |
$\mathrm{``u"}$ |
|
$\mathrm{``B"}$ |
$\mathrm{``i"}$ |
| $\mathrm{``u"}$ |
$\mathrm{``B"}$ |
|
$\mathrm{``i"}$ |
$\mathrm{``B"}$ |
| $\mathrm{``u"}$ |
$\mathrm{``u"}$ |
|
$\mathrm{``i"}$ |
$\mathrm{``i"}$ |
| |
|
|
|
|
One nice property possessed by the sign relations $L_{\mathrm{A}}$ and $L_{\mathrm{B}}$ is that their connotative components $\mathrm{A}_{SI}$ and $\mathrm{B}_{SI}$ constitute a pair of equivalence relations on their common syntactic domain $S = I$ . It is convenient to refer to such a structure as a semiotic equivalence relation (SER) since it equates signs that mean the same thing to some interpreter. Each of the SER's, $\mathrm{A}_{SI}, \mathrm{B}_{SI} \subseteq S \times I \cong S \times S$ partitions the whole collection of signs into semiotic equivalence classes (SEC's). This makes for a strong form of representation in that the structure of the participants' common object domain $\{ \mathrm{A}, \mathrm{B} \}$ is reflected or reconstructed, part for part, in the structure of each of their semiotic partitions (SEP's) of the syntactic domain $\{ \mathrm{``A"}, \mathrm{``B"}, \mathrm{``i"}, \mathrm{``u"}, \}$ . But it needs to be noted that the semiotic partitions for $\mathrm{A}$ and $\mathrm{B}$ are not the same, indeed, they are orthogonal to each other. This makes it difficult to interpret either one of the
partitions or equivalence relations on the syntactic domain as corresponding to any sort of objective structure or invariant reality, independent of the individual interpreter's point of view (POV).
Information about the different patterns of semiotic equivalence induced by the interpreters $\mathrm{A}$ and $\mathrm{B}$ is summarized in Tables 5 and 6. The form of these Tables should suffice to explain what is meant by saying that the SEP's for $\mathrm{A}$ and $\mathrm{B}$ are orthogonal to each other.
| Table 5. SEP for $\mathrm{A}$ |
|
Table 6. SEP for $\mathrm{B}$ |
| |
$\mathrm{``A"}$ |
|
|
$\mathrm{``i"}$ |
|
|
|
$\mathrm{``A"}$ |
|
|
$\mathrm{``i"}$ |
|
| |
$\mathrm{``u"}$ |
|
|
$\mathrm{``B"}$ |
|
|
|
$\mathrm{``u"}$ |
|
|
$\mathrm{``B"}$ |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
A few items of notation are useful in discussing equivalence relations in general and semiotic equivalence relations in particular.
As a general consideration, if $E$ is an equivalence relation on a set $X$ , then every element $x$ of $X$ belongs to a unique equivalence class under $E$ called ``the equivalence class of $x$ under $E$ ". Convention provides the square bracket notation for denoting this equivalence class, either in the subscripted form $[x]_E$ or in the simpler form $[x]$ when the subscript $E$ is understood. A statement that the elements $x$ and $y$ are equivalent under
$E$ is called an equation and can be expressed in numerous ways, for example, any of the following equivalent statements:
- $(x, y) \in E$
- $x \in [y]_E$
- $y \in [x]_E$
- $[x]_E = [y]_E$
- $x =_E y$
Thus we have the following definitions:
- $[x]_E := \{ y \in X : (x, y) \in E \}.$
- $x =_E y \iff (x, y) \in E.$
In the application to sign relations it is useful to extend the square bracket notation in the following ways. If $L$ is a sign relation whose connotative component or syntactic projection $L_{SI}$ is an equivalence relation on $S$ , let $[s]_L$ be the equivalence class of $s$ under $L_{SI}$ . That is to say, $[s]_L := [s]_{L_{SI}}$ . A statement that the signs $x$ and $y$ are equivalent under a semiotic equivalence relation $L_{SI}$ is called a semiotic equation (SEQ) and can be written in either of the
forms, $[x]_L = [y]_L$ or $x =_L y$ .
In many situations there is one further adaptation of the square bracket notation that can be useful. Namely, when there is known to exist a particular triple $(o, s, i) \in L$ , it is permissible to let $[o]_L := [s]_L$ . These modifications are designed to make the notation for semiotic equivalence classes harmonize as well as possible with the frequent use of similar devices for the denotations of signs and expressions.
The SER for interpreter $\mathrm{A}$ yields the following semiotic equations:
| |
$[\mathrm{``A"}]_{\mathrm{A}}$ |
$=$ |
$[\mathrm{``i"}]_{\mathrm{A}}$ |
| |
$[\mathrm{``B"}]_{\mathrm{A}}$ |
$=$ |
$[\mathrm{``u"}]_{\mathrm{A}}$ |
| or |
|
|
|
| |
$\mathrm{``A"}$ |
$=_{\mathrm{A}}$ |
$\mathrm{``i"}$ |
| |
$\mathrm{``B"}$ |
$=_{\mathrm{A}}$ |
$\mathrm{``u"}$ |
and the semiotic partition: $\{ \{ \mathrm{``A"}, \mathrm{``i"} \}, \{ \mathrm{``B"}, \mathrm{``u"} \} \}.$
The SER for interpreter $\mathrm{B}$ yields the following semiotic equations:
| |
$[\mathrm{``A"}]_{\mathrm{B}}$ |
$=$ |
$[\mathrm{``u"}]_{\mathrm{B}}$ |
| |
$[\mathrm{``B"}]_{\mathrm{B}}$ |
$=$ |
$[\mathrm{``i"}]_{\mathrm{B}}$ |
| or |
|
|
|
| |
$\mathrm{``A"}$ |
$=_{\mathrm{B}}$ |
$\mathrm{``u"}$ |
| |
$\mathrm{``B"}$ |
$=_{\mathrm{B}}$ |
$\mathrm{``i"}$ |
and the semiotic partition: $\{ \{ \mathrm{``A"}, \mathrm{``u"} \}, \{ \mathrm{``B"}, \mathrm{``i"} \} \}.$
|