Changes

The relation <math>\operatorname{Der}(L)</math> is defined and the notation <math>x ~\overset{L}{=}~ y</math> is meaningful in every situation where the corresponding denotation operator <math>\operatorname{Den}(-,-)</math> makes sense, but it remains to check whether this relation enjoys the properties of an equivalence relation.

The relation <math>\operatorname{Der}(L)</math> is defined and the notation <math>x ~\overset{L}{=}~ y</math> is meaningful in every situation where the corresponding denotation operator <math>\operatorname{Den}(-,-)</math> makes sense, but it remains to check whether this relation enjoys the properties of an equivalence relation.

# Reflexive property.  Is it true that <math>x ~\overset{L}{=}~ x</math> for every <math>x \in S = I</math>?  By definition, <math>x ~\overset{L}{=}~ x</math> if and only if <math>\operatorname{Den}(L, x) = \operatorname{Den}(L, x).</math> Thus, the reflexive property holds in any setting where the denotations <math>\operatorname{Den}(L, x)</math> are defined for all signs <math>x\!</math> in the syntactic domain of <math>R.\!</math>

1. Reflexive property.  Is it true that x =R x for every x C S = I?  By definition, x =R x if and only if Den(R, x) = Den(R, x).  Thus, the reflexive property holds in any setting where the denotations Den(R, x) are defined for all signs x in the syntactic domain of R.

# Symmetric property.  Does <math>x ~\overset{L}{=}~ y ~\Rightarrow~ y ~\overset{L}{=}~ x</math> for all <math>x, y \in S</math>?  In effect, does <math>\operatorname{Den}(L, x) = \operatorname{Den}(L, y)</math> imply <math>\operatorname{Den}(L, y) = \operatorname{Den}(L, x)</math> for all signs <math>x\!</math> and <math>y\!</math> in the syntactic domain <math>S\!</math>?  Yes, so long as the sets <math>\operatorname{Den}(L, x)</math> and <math>\operatorname{Den}(L, y)</math> are well-defined, a fact which is already being assumed.

 

# Transitive property.  Does <math>x ~\overset{L}{=}~ y</math> and <math>y ~\overset{L}{=}~ z</math> imply <math>x ~\overset{L}{=}~ z</math> for all <math>x, y, z \in S</math>?  To belabor the point, does <math>\operatorname{Den}(L, x) = \operatorname{Den}(L, y)</math> and <math>\operatorname{Den}(L, y) = \operatorname{Den}(L, z)</math> imply <math>\operatorname{Den}(L, x) = \operatorname{Den}(L, z)</math> for all <math>x, y, z \in S</math>?  Yes, again, under the stated conditions.

2. Symmetric property.  Does x =R y =>  y =R x for all x, y C S?  In effect, does Den(R, x) = Den(R, y) imply Den(R, y) = Den(R, x) for all signs x and y in the syntactic domain S?  Yes, so long as the sets Den(R, x) and Den(R, y) are well-defined, a fact which is already being assumed.

 

3. Transitive property.  Does x =R y &  y =R z => x =R z for all x, y, z C S?  To belabor the point, does Den(R, x) = Den(R, y) and Den(R, y) = Den(R, z) imply Den(R, x) = Den(R, z) for all x, y, z in S?  Yes, again, under the stated conditions.

It should be clear at this point that any question about the equiference of signs reduces to a question about the equality of sets, specifically, the sets that are indexed by these signs.  As a result, so long as these sets are well-defined, the issue of whether equiference relations induce equivalence relations on their syntactic domains is almost as trivial as it initially appears.

It should be clear at this point that any question about the equiference of signs reduces to a question about the equality of sets, specifically, the sets that are indexed by these signs.  As a result, so long as these sets are well-defined, the issue of whether equiference relations induce equivalence relations on their syntactic domains is almost as trivial as it initially appears.

Taken in its set-theoretic extension, a relation of equiference induces a "denotative equivalence relation" (DER) on its syntactic domain S = I.  This leads to the formation of "denotative equivalence classes" (DEC's), "denotative partitions" (DEP's), and "denotative equations" (DEQ's) on the syntactic domain.  But what does it mean for signs to be equiferent?

Taken in its set-theoretic extension, a relation of equiference induces a "denotative equivalence relation" (DER) on its syntactic domain S = I.  This leads to the formation of "denotative equivalence classes" (DEC's), "denotative partitions" (DEP's), and "denotative equations" (DEQ's) on the syntactic domain.  But what does it mean for signs to be equiferent?