12,080
edits
Changes
Directory:Jon Awbrey/Papers/Syntactic Transformations (view source)
Revision as of 22:14, 9 December 2015
, 22:14, 9 December 2015'''Author: Jon Awbrey'''
{{DISPLAYTITLE:Syntactic Transformations}}
{{DISPLAYTITLE:Syntactic Transformations}}
'''Author: [[User:Jon Awbrey|Jon Awbrey]]'''
<div class="nonumtoc">__TOC__</div>
<div class="nonumtoc">__TOC__</div>
==Syntactic Transformations==
====1.3.12. Syntactic Transformations====
To discuss the import of the above definitions in greater depth, it serves to establish a number of logical relations and set-theoretic identities that can be found to hold among this array of conceptions and constructions. Facilitating this task requires in turn a number of auxiliary concepts and notations.
We have been examining several distinct but closely related notions of ''indication''. To discuss the import of these ideas in greater depth, it serves to establish a number of logical relations and set-theoretic identities that can be found to hold among their roughly parallel arrays of conceptions and constructions. Facilitating this task requires in turn a number of auxiliary concepts and notations. The notions of indication in question are expressed in a variety of different notations, enumerated as follows:
The diverse notions of ''indication'' under discussion are expressed in a variety of different notations, in particular, the logical language of sentences, the functional language of propositions, and the geometric language of sets. Thus, one way to explain the relationships that exist among these concepts is to describe the ''translations'' that they induce among the allied families of notation.
# The functional language of propositions
# The logical language of sentences
# The geometric language of sets
===Syntactic Transformation Rules===
Thus, one way to explain the relationships that hold among these concepts is to describe the ''translations'' that are induced among their allied families of notation.
=====1.3.12.1. Syntactic Transformation Rules=====
A good way to summarize these translations and to organize their use in practice is by means of the ''syntactic transformation rules'' (STRs) that partially formalize them. A rudimentary example of a STR is readily mined from the raw materials that are already available in this area of discussion. To begin, let the definition of an indicator function be recorded in the following form:
A good way to summarize these translations and to organize their use in practice is by means of the ''syntactic transformation rules'' (STRs) that partially formalize them. A rudimentary example of a STR is readily mined from the raw materials that are already available in this area of discussion. To begin, let the definition of an indicator function be recorded in the following form:
'''Editing Note.''' Need a transition here. Give a brief description of the Tables of Translation Rules that have now been moved to the Appendices, and then move on to the rest of the Definitions and Proof Schemata.
'''Editing Note.''' Need a transition here. Give a brief description of the Tables of Translation Rules that have now been moved to the Appendices, and then move on to the rest of the Definitions and Proof Schemata.
A rule that allows one to turn equivalent sentences into identical propositions:
<pre>
{| align="center" cellpadding="8" width="90%"
| <math>(S \Leftrightarrow T) \quad \Leftrightarrow \quad (\downharpoonleft S \downharpoonright = \downharpoonleft T \downharpoonright)</math>
|}
Compare:
{| align="center" cellpadding="8" width="90%"
| <math>\downharpoonleft v = w \downharpoonright (v, w)</math>
|-
| <math>\downharpoonleft v(u) = w(u) \downharpoonright (u)</math>
|}
'''Editing Note.''' The last draft I can find has 5 variants for the next box, "Value Rule 1", and I can't tell right off which I meant to use. Until I can get back to this, here's a link to the collection of variants:
* [http://mywikibiz.com/User:Jon_Awbrey/SCRATCHPAD#Value_Rule_1 Value Rule 1]
<br>
<br>
<pre>
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:50px; text-align:right"
| width="98%" | <math>\operatorname{Evaluation~Rule~1}</math>
| width="2%" |
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:50px"
| width="2%" style="border-top:1px solid black" |
</pre>
| width="14%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="84%" style="border-top:1px solid black" | <math>f, g ~:~ X \to \underline\mathbb{B}</math>
<br>
|- style="height:50px"
|
<pre>
| <math>\text{and}\!</math>
| <math>x ~\in~ X</math>
|- style="height:50px"
|
| <math>\text{then}\!</math>
| <math>\text{the following are equivalent:}\!</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:10px"
| width="2%" style="border-top:1px solid black" |
| width="14%" style="border-top:1px solid black" |
| width="64%" style="border-top:1px solid black" |
| width="20%" style="border-top:1px solid black; border-left:1px solid black" |
|- style="height:40px"
|
| <math>\operatorname{E1a.}</math>
</pre>
| <math>f(x) ~=~ g(x)</math>
| style="border-left:1px solid black; text-align:center" | <math>\operatorname{E1a~:~V1a}</math>
<br>
|- style="height:20px"
| colspan="3" |
<pre>
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:40px"
|
| <math>\operatorname{E1b.}</math>
| <math>f(x) ~\Leftrightarrow~ g(x)</math>
| style="border-left:1px solid black; text-align:center" | <math>\operatorname{E1b~:~V1b}</math>
|- style="height:20px"
| colspan="3" |
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:60px"
|
| <math>\operatorname{E1c.}</math>
| <math>\underline{((}~ f(x) ~,~ g(x) ~\underline{))}</math>
| style="border-left:1px solid black; text-align:center" |
</pre>
<p><math>\operatorname{E1c~:~V1c}</math></p>
<p><math>\operatorname{E1c~:~$1a}</math></p>
|- style="height:20px"
| colspan="3" |
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:40px"
|
| <math>\operatorname{E1d.}</math>
| <math>\underline{((}~ f ~,~ g ~\underline{))}^\$ (x)</math>
| style="border-left:1px solid black; text-align:center" | <math>\operatorname{E1d~:~$1b}</math>
|- style="height:10px"
| colspan="3" |
| style="border-left:1px solid black" |
|}
|}
<br>
<br>
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px; text-align:center"
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px; text-align:center"
| width="80%" |
| width="80%" |
| width="20%" | <math>\operatorname{Definition~2}</math>
| width="20%" | <math>\operatorname{Definition~2}</math>
<br>
<br>
===Derived Equivalence Relations===
=====1.3.12.2. Derived Equivalence Relations=====
One seeks a method of general application for approaching the individual sign relation, a way to select an aspect of its form, to analyze it with regard to its intrinsic structure, and to classify it in comparison with other sign relations. With respect to a particular sign relation, one approach that presents itself is to examine the relation between signs and interpretants that is given directly by its connotative component and to compare it with the various forms of derived, indirect, mediate, or peripheral relationships that can be found to exist among signs and interpretants by way of secondary considerations or subsequent studies. Of especial interest are the relationships among signs and interpretants that can be obtained by working through the collections of objects that they commonly or severally denote.
One seeks a method of general application for approaching the individual sign relation, a way to select an aspect of its form, to analyze it with regard to its intrinsic structure, and to classify it in comparison with other sign relations. With respect to a particular sign relation, one approach that presents itself is to examine the relation between signs and interpretants that is given directly by its connotative component and to compare it with the various forms of derived, indirect, mediate, or peripheral relationships that can be found to exist among signs and interpretants by way of secondary considerations or subsequent studies. Of especial interest are the relationships among signs and interpretants that can be obtained by working through the collections of objects that they commonly or severally denote.
A classic way of showing that two sets are equal is to show that every element of the first belongs to the second and that every element of the second belongs to the first. The problem with this strategy is that one can exhaust a considerable amount of time trying to prove that two sets are equal before it occurs to one to look for a counterexample, that is, an element of the first that does not belong to the second or an element of the second that does not belong to the first, in cases where that is precisely what one ought to be seeking. It would be nice if there were a more balanced, impartial, neutral, or nonchalant way to go about this task, one that did not require such an undue commitment to either side, a technique that helps to pinpoint the counterexamples when they exist, and a method that keeps in mind the original relation of "proving that" and "showing that" to probing, testing, and seeing "whether".
A classic way of showing that two sets are equal is to show that every element of the first belongs to the second and that every element of the second belongs to the first. The problem with this strategy is that one can exhaust a considerable amount of time trying to prove that two sets are equal before it occurs to one to look for a counterexample, that is, an element of the first that does not belong to the second or an element of the second that does not belong to the first, in cases where that is precisely what one ought to be seeking. It would be nice if there were a more balanced, impartial, or neutral way to go about this task, one that did not require such an undue commitment to either side, a technique that helps to pinpoint the counterexamples when they exist, and a method that keeps in mind the original relation of ''proving that'' and ''showing that'' to probing, testing, and seeing ''whether''.
A different way of seeing that two sets are equal, or of seeing whether two sets are equal, is based on the following observation:
A different way of seeing that two sets are equal, or of seeing whether two sets are equal, is based on the following observation:
{| align="center" cellpadding="8" style="text-align:center" width="90%"
<=> the indicator functions of these sets are equal as functions
| Two sets are equal as sets
<=> the values of these functions are equal on all domain elements.
|-
| <math>\iff</math>
|-
| The indicator functions of the two sets are equal as functions
|-
| <math>\iff</math>
|-
| The values of the two indicator functions are equal to each other on all domain elements.
|}
It is important to notice the hidden quantifier, of a universal kind, that lurks in all three equivalent statements but is only revealed in the last.
It is important to notice the hidden quantifier, of a universal kind, that lurks in all three equivalent statements but is only revealed in the last.
In making the next set of definitions and in using the corresponding terminology it is taken for granted that all of the references of signs are relative to a particular sign relation R c OxSxI that either remains to be specified or is already understood. Further, I continue to assume that S = I, in which case this set is called the "syntactic domain" of R.
In making the next set of definitions and in using the corresponding terminology it is taken for granted that all of the references of signs are relative to a particular sign relation <math>L \subseteq O \times S \times I</math> that either remains to be specified or is already understood. Further, I continue to assume that <math>S = I,\!</math> in which case this set is called the ''syntactic domain'' of <math>L.\!</math>
In the following definitions let R c OxSxI, let S = I, and let x, y C S.
In the following definitions, let <math>L \subseteq O \times S \times I,</math> let <math>S = I,\!</math> and let <math>x, y \in S.\!</math>
Recall the definition of Con(R), the connotative component of R, in the following form:
Recall the definition of <math>\operatorname{Con} (L),</math> the connotative component of a sign relation <math>L,\!</math> in the following form:
Con(R) = RSI = {<s, i> C SxI : <o, s, i> C R for some o C O}.
{| align="center" cellpadding="8" width="90%"
| <math>\operatorname{Con} (L) ~=~ L_{SI} ~=~ \{ (s, i) \in S \times I ~:~ (o, s, i) \in L ~\text{for some}~ o \in O \}.</math>
|}
Equivalent expressions for this concept are recorded in Definition 8.
Equivalent expressions for this concept are recorded in Definition 8.
<br>
If R c OxSxI,
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
then the following are identical subsets of SxI:
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px; text-align:center"
D8a. RSI
| width="80%" |
| width="20%" | <math>\operatorname{Definition~8}</math>
D8b. ConR
|}
|-
D8c. Con(R)
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
D8d. PrSI(R)
|- style="height:40px"
| width="2%" style="border-top:1px solid black" |
D8e. {<s, i> C SxI : <o, s, i> C R for some o C O}
| width="18%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="80%" style="border-top:1px solid black" | <math>L ~\subseteq~ O \times S \times I</math>
|- style="height:40px"
|
| <math>\text{then}\!</math>
| <math>\text{the following are identical subsets of}~ S \times I \, :</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\operatorname{D8a.}</math>
| width="80%" style="border-top:1px solid black" | <math>L_{SI}\!</math>
|- style="height:40px"
|
| <math>\operatorname{D8b.}</math>
| <math>\operatorname{Con}^L</math>
|- style="height:40px"
|
| <math>\operatorname{D8c.}</math>
| <math>\operatorname{Con}(L)</math>
|- style="height:40px"
|
| <math>\operatorname{D8d.}</math>
| <math>\operatorname{proj}_{SI}(L)</math>
|- style="height:40px"
|
| <math>\operatorname{D8e.}</math>
| <math>\{ (s, i) \in S \times I ~:~ (o, s, i) \in L ~\operatorname{for~some}~ o \in O \}</math>
|}
|}
<br>
'''Editing Note.''' Need a discussion of converse relations here. Perhaps it would work to introduce the operators that Peirce used for the converse of a dyadic relative <math>\ell,</math> namely, <math>K\ell ~=~ k\!\cdot\!\ell ~=~ \breve\ell.</math>
The dyadic relation <math>L_{IS}\!</math> that is the converse of the connotative relation <math>L_{SI}\!</math> can be defined directly in the following fashion:
{| align="center" cellpadding="8" width="90%"
| <math>\overset{\smile}{\operatorname{Con}(L)} ~=~ L_{IS} ~=~ \{ (i, s) \in I \times S ~:~ (o, s, i) \in L ~\text{for some}~ o \in O \}.</math>
|}
A few of the many different expressions for this concept are recorded in Definition 9.
<br>
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px; text-align:center"
| width="80%" |
| width="20%" | <math>\operatorname{Definition~9}</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="80%" style="border-top:1px solid black" | <math>L ~\subseteq~ O \times S \times I</math>
|- style="height:40px"
|
| <math>\text{then}\!</math>
| <math>\text{the following are identical subsets of}~ I \times S \, :</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:50px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\operatorname{D9a.}</math>
| width="80%" style="border-top:1px solid black" | <math>L_{IS}\!</math>
|- style="height:50px"
|
| <math>\operatorname{D9b.}</math>
| <math>\overset{\smile}{L_{SI}}</math>
|- style="height:50px"
|
| <math>\operatorname{D9c.}</math>
| <math>\overset{\smile}{\operatorname{Con}^L}</math>
|- style="height:50px"
|
| <math>\operatorname{D9d.}</math>
| <math>\overset{\smile}{\operatorname{Con}(L)}</math>
|- style="height:50px"
|
| <math>\operatorname{D9e.}</math>
| <math>\operatorname{proj}_{IS}(L)</math>
|- style="height:50px"
|
| <math>\operatorname{D9f.}</math>
| <math>\operatorname{Conv}(\operatorname{Con}(L))</math>
|- style="height:50px"
|
| <math>\operatorname{D9g.}</math>
| <math>\{ (i, s) \in I \times S ~:~ (o, s, i) \in L ~\operatorname{for~some}~ o \in O \}</math>
|}
|}
<br>
Recall the definition of <math>\operatorname{Den} (L),</math> the denotative component of <math>L,\!</math> in the following form:
{| align="center" cellpadding="8" width="90%"
| <math>\operatorname{Den} (L) ~=~ L_{OS} ~=~ \{ (o, s) \in O \times S ~:~ (o, s, i) \in L ~\text{for some}~ i \in I \}.</math>
|}
Equivalent expressions for this concept are recorded in Definition 10.
<br>
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px; text-align:center"
| width="80%" |
| width="20%" | <math>\operatorname{Definition~10}</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="80%" style="border-top:1px solid black" | <math>L ~\subseteq~ O \times S \times I</math>
|- style="height:40px"
|
| <math>\text{then}\!</math>
| <math>\text{the following are identical subsets of}~ O \times S \, :</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\operatorname{D10a.}</math>
| width="80%" style="border-top:1px solid black" | <math>L_{OS}\!</math>
|- style="height:40px"
|
| <math>\operatorname{D10b.}</math>
| <math>\operatorname{Den}^L</math>
|- style="height:40px"
|
| <math>\operatorname{D10c.}</math>
| <math>\operatorname{Den}(L)</math>
|- style="height:40px"
|
| <math>\operatorname{D10d.}</math>
| <math>\operatorname{proj}_{OS}(L)</math>
|- style="height:40px"
|
| <math>\operatorname{D10e.}</math>
| <math>\{ (o, s) \in O \times S ~:~ (o, s, i) \in L ~\operatorname{for~some}~ i \in I \}</math>
|}
|}
<br>
The dyadic relation <math>L_{SO}\!</math> that is the converse of the denotative relation <math>L_{OS}\!</math> can be defined directly in the following fashion:
{| align="center" cellpadding="8" width="90%"
| <math>\overset{\smile}{\operatorname{Den}(L)} ~=~ L_{SO} ~=~ \{ (s, o) \in S \times O ~:~ (o, s, i) \in L ~\text{for some}~ i \in I \}.</math>
|}
A few of the many different expressions for this concept are recorded in Definition 11.
<br>
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px; text-align:center"
| width="80%" |
| width="20%" | <math>\operatorname{Definition~11}</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="80%" style="border-top:1px solid black" | <math>L ~\subseteq~ O \times S \times I</math>
|- style="height:40px"
|
| <math>\text{then}\!</math>
| <math>\text{the following are identical subsets of}~ S \times O \, :</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:50px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\operatorname{D11a.}</math>
| width="80%" style="border-top:1px solid black" | <math>L_{SO}\!</math>
|- style="height:50px"
|
| <math>\operatorname{D11b.}</math>
| <math>\overset{\smile}{L_{OS}}</math>
|- style="height:50px"
|
| <math>\operatorname{D11c.}</math>
| <math>\overset{\smile}{\operatorname{Den}^L}</math>
|- style="height:50px"
|
| <math>\operatorname{D11d.}</math>
| <math>\overset{\smile}{\operatorname{Den}(L)}</math>
|- style="height:50px"
|
| <math>\operatorname{D11e.}</math>
| <math>\operatorname{proj}_{SO}(L)</math>
|- style="height:50px"
|
| <math>\operatorname{D11f.}</math>
| <math>\operatorname{Conv}(\operatorname{Den}(L))</math>
|- style="height:50px"
|
| <math>\operatorname{D11g.}</math>
| <math>\{ (s, o) \in S \times O ~:~ (o, s, i) \in L ~\operatorname{for~some}~ i \in I \}</math>
|}
|}
<br>
The ''denotation of <math>x\!</math> in <math>L,\!</math>'' written <math>\operatorname{Den}(L, x),</math> is defined as follows:
{| align="center" cellpadding="8" width="90%"
| <math>\operatorname{Den}(L, x) ~=~ \{ o \in O ~:~ (o, x) \in \operatorname{Den}(L) \}.</math>
|}
In other words:
{| align="center" cellpadding="8" width="90%"
| <math>\operatorname{Den}(L, x) ~=~ \{ o \in O ~:~ (o, x, i) \in L ~\text{for some}~ i \in I \}.</math>
|}
Equivalent expressions for this concept are recorded in Definition 12.
<br>
Definition 13
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
If R c OxSxI,
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px; text-align:center"
then the following are identical subsets of SxI:
| width="80%" |
| width="20%" | <math>\operatorname{Definition~12}</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="80%" style="border-top:1px solid black" | <math>L ~\subseteq~ O \times S \times I</math>
|- style="height:40px"
|
| <math>\text{and}\!</math>
| <math>x ~\in~ S</math>
|- style="height:40px"
|
| <math>\text{then}\!</math>
| <math>\text{the following are identical subsets of}~ O \, :</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\operatorname{D12a.}</math>
| width="80%" style="border-top:1px solid black" | <math>L_{OS} \cdot x</math>
|- style="height:40px"
|
| <math>\operatorname{D12b.}</math>
| <math>\operatorname{Den}^L \cdot x</math>
|- style="height:40px"
|
| <math>\operatorname{D12c.}</math>
| <math>\operatorname{Den}^L |_x</math>
|- style="height:40px"
|
| <math>\operatorname{D12d.}</math>
| <math>\operatorname{Den}^L (-, x)</math>
|- style="height:40px"
|
| <math>\operatorname{D12e.}</math>
| <math>\operatorname{Den}(L, x)</math>
|- style="height:40px"
|
| <math>\operatorname{D12f.}</math>
| <math>\operatorname{Den}(L) \cdot x</math>
|- style="height:40px"
|
| <math>\operatorname{D12g.}</math>
| <math>\{ o \in O ~:~ (o, x) \in \operatorname{Den}(L) \}</math>
|- style="height:40px"
|
| <math>\operatorname{D12h.}</math>
| <math>\{ o \in O ~:~ (o, x, i) \in L ~\operatorname{for~some}~ i \in I \}</math>
|}
|}
<br>
Signs are ''equiferent'' if they refer to all and only the same objects, that is, if they have exactly the same denotations. In other language for the same relation, signs are said to be ''denotatively equivalent'' or ''referentially equivalent'', but it is probably best to check whether the extension of this concept over the syntactic domain is really a genuine equivalence relation before jumping to the conclusions that are implied by these latter terms.
To define the ''equiference'' of signs in terms of their denotations, one says that ''<math>x\!</math> is equiferent to <math>y\!</math> under <math>L,\!</math>'' and writes <math>x ~\overset{L}{=}~ y,\!</math> to mean that <math>\operatorname{Den}(L, x) = \operatorname{Den}(L, y).</math> Taken in extension, this notion of a relation between signs induces an ''equiference relation'' on the syntactic domain.
For each sign relation <math>L,\!</math> this yields a binary relation <math>\operatorname{Der}(L) \subseteq S \times I</math> that is defined as follows:
{| align="center" cellpadding="8" width="90%"
| <math>\operatorname{Der}(L) ~=~ Der^L ~=~ \{ (x, y) \in S \times I ~:~ \operatorname{Den}(L, x) = \operatorname{Den}(L, y) \}.</math>
in other words, that Den(R, x) = Den(R, y).
|}
These definitions and notations are recorded in the following display.
<br>
2. If R is a sign relation such that Con(R) is a SER on S = I,
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px; text-align:center"
| width="80%" |
| width="20%" | <math>\operatorname{Definition~13}</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="80%" style="border-top:1px solid black" | <math>L ~\subseteq~ O \times S \times I</math>
|- style="height:40px"
|
| <math>\text{then}\!</math>
| <math>\text{the following are identical subsets of}~ S \times I \, :</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:40px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\operatorname{D13a.}</math>
| width="80%" style="border-top:1px solid black" | <math>\operatorname{Der}^L</math>
|- style="height:40px"
|
| <math>\operatorname{D13b.}</math>
| <math>\operatorname{Der}(L)</math>
|- style="height:40px"
|
| <math>\operatorname{D13c.}</math>
| <math>\{ (x, y) \in S \times I ~:~ \operatorname{Den}^L|_x = \operatorname{Den}^L|_y \}</math>
|- style="height:40px"
|
| <math>\operatorname{D13d.}</math>
| <math>\{ (x, y) \in S \times I ~:~ \operatorname{Den}(L, x) = \operatorname{Den}(L, y) \}</math>
|}
|}
<br>
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.
<ol style="list-style-type:decimal">
<li>
<p>'''Reflexive property.'''</p>
<p>Is it true that <math>x ~\overset{L}{=}~ x</math> for every <math>x \in S = I</math>?</p>
<p> By definition, <math>x ~\overset{L}{=}~ x</math> if and only if <math>\operatorname{Den}(L, x) = \operatorname{Den}(L, x).</math></p>
<p>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></p></li>
<li>
<p>'''Symmetric property.'''</p>
<p>Does <math>x ~\overset{L}{=}~ y</math> imply <math>y ~\overset{L}{=}~ x</math> for all <math>x, y \in S</math>?</p>
<p>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>?</p>
<p>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.</p></li>
<li>
<p>'''Transitive property.'''</p>
<p>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>?</p>
<p>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>?</p>
<p>Yes, once again, under the stated conditions.</p></li>
</ol>
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 <math>S = I.\!</math> This leads to the formation of ''denotative equivalence classes'' (DECs), ''denotative partitions'' (DEPs), and ''denotative equations'' (DEQs) on the syntactic domain. But what does it mean for signs to be equiferent?
Notice that this is not the same thing as being ''semiotically equivalent'', in the sense of belonging to a single ''semiotic equivalence class'' (SEC), falling into the same part of a ''semiotic partition'' (SEP), or having a ''semiotic equation'' (SEQ) between them. It is only when very felicitous conditions obtain, establishing a concord between the denotative and the connotative components of a sign relation, that these two ideas coalesce.
In general, there is no necessity that the equiference of signs, that is, their denotational equivalence or their referential equivalence, induces the same equivalence relation on the syntactic domain as that defined by their semiotic equivalence, even though this state of accord seems like an especially desirable situation. This makes it necessary to find a distinctive nomenclature for these structures, for which I adopt the term ''denotative equivalence relations'' (DERs). In their train they bring the allied structures of ''denotative equivalence classes'' (DECs) and ''denotative partitions'' (DEPs), while the corresponding statements of ''denotative equations'' (DEQs) are expressible in the form <math>x ~\overset{L}{=}~ y.</math>
The uses of the equal sign for denoting equations or equivalences are recalled and extended in the following ways:
# If <math>E\!</math> is an arbitrary equivalence relation, then the equation <math>x =_E y\!</math> means that <math>(x, y) \in E.</math>
# If <math>L\!</math> is a sign relation such that <math>L_{SI}\!</math> is a SER on <math>S = I,\!</math> then the semiotic equation <math>x =_L y\!</math> means that <math>(x, y) \in L_{SI}.</math>
# If <math>L\!</math> is a sign relation such that <math>F\!</math> is its DER on <math>S = I,\!</math> then the denotative equation <math>x ~\overset{L}{=}~ y</math> means that <math>(x, y) \in F,</math> in other words, that <math>\operatorname{Den}(L, x) = \operatorname{Den}(L, y).</math>
The use of square brackets for denoting equivalence classes is recalled and extended in the following ways:
==Appendices==
# If <math>E\!</math> is an arbitrary equivalence relation, then <math>[x]_E\!</math> is the equivalence class of <math>x\!</math> under <math>E.\!</math>
# If <math>L\!</math> is a sign relation such that <math>\operatorname{Con}(L)</math> is a SER on <math>S = I,\!</math> then <math>[x]_L\!</math> is the SEC of <math>x\!</math> under <math>\operatorname{Con}(L).</math>
# If <math>L\!</math> is a sign relation such that <math>\operatorname{Der}(L)</math> is a DER on <math>S = I,\!</math> then <math>[x]^L\!</math> is the DEC of <math>x\!</math> under <math>\operatorname{Der}(L).</math>
By applying the form of Fact 1 to the special case where <math>X = \operatorname{Den}(L, x)</math> and <math>Y = \operatorname{Den}(L, y),</math> one obtains the following facts.
<br>
<br>
|
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:48px; text-align:right"
|- style="height:50px; text-align:center"
| width="98%" | <math>\text{Logical Translation Rule 1}\!</math>
| style="width:80%" |
| style="width:20%; border-left:1px solid black" | <math>\operatorname{Fact~2.1}</math>
|}
|}
|-
|-
|
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:48px"
|- style="height:50px"
| width="2%" style="border-top:1px solid black" |
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="10%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="80%" style="border-top:1px solid black" |
| width="68%" style="border-top:1px solid black" | <math>L ~\subseteq~ O \times S \times I</math>
<math>s ~\text{is a sentence about things in the universe X}</math>
| width="20%" style="border-top:1px solid black; border-left:1px solid black" |
|- style="height:48px"
|- style="height:50px"
|
|
| <math>\text{and}\!</math>
| <math>\text{then}\!</math>
| <math>p ~\text{is a proposition} ~:~ X \to \underline\mathbb{B}</math>
| <math>\text{the following are identical subsets of}~ S \times I :</math>
|- style="height:48px"
| style="border-left:1px solid black" |
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:60px"
| width="2%" style="border-top:1px solid black" |
| width="10%" style="border-top:1px solid black" | <math>\operatorname{F2.1a.}</math>
| width="68%" style="border-top:1px solid black" | <math>\operatorname{Der}^L</math>
| width="20%" style="border-top:1px solid black; border-left:1px solid black; text-align:center" | <math>\operatorname{F2.1a~:~D13a}</math>
|- style="height:20px"
|
|
|
|
|
|
| <math>\text{L1a.}\!</math>
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
| <math>\downharpoonleft s \downharpoonright ~=~ p</math>
|- style="height:40px"
|- style="height:48px"
|
| valign="top" | <math>\operatorname{F2.1b.}</math>
| valign="top" | <math>\operatorname{Der}(L)</math>
| style="border-left:1px solid black; text-align:center" |
<math>\operatorname{F2.1b~:~D13b}</math>
|- style="height:20px"
|
|
|
|
|
| align="left" | <math>\text{L1b}_{01}.\!</math>
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
| <math>\downharpoonleft \operatorname{not}~ s \downharpoonright</math>
|- style="height:60px"
| <math>=\!</math>
|
| <math>(\downharpoonleft s \downharpoonright)</math>
| valign="top" | <math>\operatorname{F2.1c.}</math>
| valign="top" |
| <math>(p) ~:~ X \to \underline\mathbb{B}</math>
<math>\begin{array}{ll}
|- style="height:52px"
\{ & (x, y) \in S \times I ~: \\
& \operatorname{Den}(L, x) ~=~ \operatorname{Den}(L, y) \\
\} & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" |
<p><math>\operatorname{F2.1c~:~D13c}</math></p>
<p><math>\operatorname{F2.1c~:~R9a}</math></p>
|- style="height:20px"
|
|
|
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:60px"
|
|
| align="left" | <math>\text{L1b}_{10}.\!</math>
| valign="top" | <math>\operatorname{F2.1d.}</math>
| <math>\downharpoonleft s \downharpoonright</math>
| valign="top" |
<math>\begin{array}{ll}
\{ & (x, y) \in S \times I ~: \\
| <math>=\!</math>
& \upharpoonleft \operatorname{Den}(L, x) \upharpoonright ~=~ \upharpoonleft \operatorname{Den}(L, y) \upharpoonright \\
\} & \\
|- style="height:52px"
\end{array}</math>
| style="border-left:1px solid black; text-align:center" |
<math>\operatorname{F2.1d~:~R9b}</math>
|- style="height:20px"
|
|
|
|
|
|
| <math>\text{such that:}\!</math>
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:60px"
|
|
|- style="height:48px"
| valign="top" | <math>\operatorname{F2.1e.}</math>
| valign="top" |
<math>\begin{array}{ll}
\{ & (x, y) \in S \times I ~: \\
& \overset{O}{\underset{o}{\forall}}~ \upharpoonleft \operatorname{Den}(L, x) \upharpoonright (o) ~=~ \upharpoonleft \operatorname{Den}(L, y) \upharpoonright (o) \\
\} & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" |
<math>\operatorname{F2.1e~:~R9c}</math>
|- style="height:20px"
|
|
|
|
|
|
| align="left" | <math>\text{G1b}_{01}.\!</math>
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
| <math>\upharpoonleft {}^{_\sim} Q \upharpoonright</math>
|- style="height:60px"
| <math>=\!</math>
|
| <math>(\upharpoonleft Q \upharpoonright)</math>
| valign="top" | <math>\operatorname{F2.1f.}</math>
| <math>=\!</math>
| valign="top" |
| <math>(p) ~:~ X \to \underline\mathbb{B}</math>
<math>\begin{array}{ll}
|- style="height:52px"
\{ & (x, y) \in S \times I ~: \\
& \underset{o \in O}{\operatorname{Conj}}~ \upharpoonleft \operatorname{Den}(L, x) \upharpoonright (o) ~=~ \upharpoonleft \operatorname{Den}(L, y) \upharpoonright (o) \\
\} & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" |
<math>\operatorname{F2.1f~:~R9d}</math>
|- style="height:20px"
|
|
|
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:60px"
|
| valign="top" | <math>\operatorname{F2.1g.}</math>
| valign="top" |
<math>\begin{array}{ll}
\{ & (x, y) \in S \times I ~: \\
& \underset{o \in O}{\operatorname{Conj}}~ \underline{((}~ \upharpoonleft \operatorname{Den}(L, x) \upharpoonright (o) ~,~ \upharpoonleft \operatorname{Den}(L, y) \upharpoonright (o) ~\underline{))} \\
\} & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" |
<math>\operatorname{F2.1g~:~R9e}</math>
|- style="height:20px"
|
|
|
|
|
| align="left" | <math>\text{G1b}_{11}.\!</math>
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
| <math>\upharpoonleft X \upharpoonright</math>
|- style="height:60px"
| <math>=\!</math>
|
| valign="top" | <math>\operatorname{F2.1h.}</math>
| <math>=\!</math>
| valign="top" |
| <math>\underline{1} ~:~ X \to \underline\mathbb{B}</math>
<math>\begin{array}{ll}
|}
\{ & (x, y) \in S \times I ~: \\
& \underset{o \in O}{\operatorname{Conj}}~ \underline{((}~ \upharpoonleft \operatorname{Den}(L, x) \upharpoonright ~,~ \upharpoonleft \operatorname{Den}(L, y) \upharpoonright ~\underline{))}^\$ (o) \\
\} & \\
<br>
\end{array}</math>
| style="border-left:1px solid black; text-align:center" |
<p><math>\operatorname{F2.1h~:~R9f}</math></p>
<p><math>\operatorname{F2.1h~:~D12e}</math></p>
|- style="height:20px"
|
|
|
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:60px"
|
| valign="top" | <math>\operatorname{F2.1i.}</math>
| valign="top" |
<math>\begin{array}{ll}
\{ & (x, y) \in S \times I ~: \\
& \underset{o \in O}{\operatorname{Conj}}~ \underline{((}~ \upharpoonleft L_{OS} \cdot x \upharpoonright ~,~ \upharpoonleft L_{OS} \cdot y \upharpoonright ~\underline{))}^\$ (o) \\
\} & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" |
<math>\operatorname{F2.1i~:~D12a}</math>
|}
|}
<br>
<br>
|
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:48px; text-align:right"
|- style="height:50px; text-align:center"
| width="98%" | <math>\text{Logical Translation Rule 2}\!</math>
| style="width:80%" |
| style="width:20%; border-left:1px solid black" | <math>\operatorname{Fact~2.2}</math>
|}
|}
|-
|-
|
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:48px"
|- style="height:50px"
| width="2%" style="border-top:1px solid black" |
| width="2%" style="border-top:1px solid black" |
| width="14%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="12%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="84%" style="border-top:1px solid black" |
| width="66%" style="border-top:1px solid black" | <math>L ~\subseteq~ O \times S \times I</math>
<math>s, t ~\text{are sentences about things in the universe}~ X</math>
| width="20%" style="border-top:1px solid black; border-left:1px solid black" |
|- style="height:48px"
|- style="height:50px"
|
|
| <math>\text{and}\!</math>
| <math>\text{then}\!</math>
| <math>p, q ~\text{are propositions} ~:~ X \to \underline\mathbb{B}</math>
| <math>\text{the following are equivalent:}\!</math>
| style="border-left:1px solid black" |
|
|
|}
|}
|-
|-
|
|
{| align="center" cellpadding="0" cellspacing="0" style="text-align:center" width="100%"
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:52px"
|- style="height:10px"
| width="2%" style="border-top:1px solid black" |
| width="2%" style="border-top:1px solid black" |
| width="14%" style="border-top:1px solid black" align="left" | <math>\text{L2b}_{0}.\!</math>
| width="12%" style="border-top:1px solid black" |
| width="32%" style="border-top:1px solid black" |
| width="66%" style="border-top:1px solid black" |
| width="20%" style="border-top:1px solid black; border-left:1px solid black" |
| width="4%" style="border-top:1px solid black" | <math>=\!</math>
|- style="height:100px"
| width="28%" style="border-top:1px solid black" | <math>(~)</math>
|
| width="4%" style="border-top:1px solid black" | <math>=\!</math>
| valign="top" | <math>\operatorname{F2.2a.}</math>
| width="16%" style="border-top:1px solid black" | <math>(~)</math>
| valign="top" |
|- style="height:52px"
<math>\begin{array}{cccl}
\operatorname{Der}^L
& = & \{ & (x, y) \in S \times I ~: \\
& & & \begin{array}{ccl}
\underset{o \in O}{\operatorname{Conj}} \\
& ( & \upharpoonleft \operatorname{Den}^L x \upharpoonright (o) \\
& = & \upharpoonleft \operatorname{Den}^L y \upharpoonright (o) \\
& ) & \\
\end{array} \\
& & \} & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" | <math>\operatorname{F2.2a~:~R11a}</math>
|- style="height:20px"
| colspan="3" |
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:100px"
|
|
| align="left" | <math>\text{L2b}_{1}.\!</math>
| valign="top" | <math>\operatorname{F2.2b.}</math>
| <math>\downharpoonleft \operatorname{neither}~ s ~\operatorname{nor}~ t \downharpoonright</math>
| valign="top" |
<math>\begin{array}{ccccl}
\upharpoonleft \operatorname{Der}^L \upharpoonright
| <math>=\!</math>
& = & \upharpoonleft & \{ & (x, y) \in S \times I ~: \\
| <math>(p)(q)\!</math>
& & & & \begin{array}{ccl}
|- style="height:52px"
\underset{o \in O}{\operatorname{Conj}} \\
& ( & \upharpoonleft \operatorname{Den}^L x \upharpoonright (o) \\
& = & \upharpoonleft \operatorname{Den}^L y \upharpoonright (o) \\
& ) & \\
\end{array} \\
& & & \} & \\
& & \upharpoonright & & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" |
<math>\operatorname{F2.2b~:~R11b}</math>
|- style="height:20px"
| colspan="3" |
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:100px"
|
|
| align="left" | <math>\text{L2b}_{2}.\!</math>
| valign="top" | <math>\operatorname{F2.2c.}</math>
| <math>\downharpoonleft \operatorname{not}~ s ~\operatorname{but}~ t \downharpoonright</math>
| valign="top" |
<math>\begin{array}{cccl}
\upharpoonleft \operatorname{Der}^L \upharpoonright
| <math>=\!</math>
& = & \{ & (x, y, z) \in S \times I \times \underline\mathbb{B} ~:~ z = \\
| <math>(p) q\!</math>
& & & \begin{array}{cccl}
|- style="height:52px"
\downharpoonleft & \underset{o \in O}{\operatorname{Conj}} \\
& & ( & \upharpoonleft \operatorname{Den}^L x \upharpoonright (o) \\
& & = & \upharpoonleft \operatorname{Den}^L y \upharpoonright (o) \\
& & ) & \\
\downharpoonright & & \\
\end{array} \\
& & \} & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" |
<math>\operatorname{F2.2c~:~R11c}</math></p>
|- style="height:20px"
| colspan="3" |
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:100px"
|
|
| align="left" | <math>\text{L2b}_{3}.\!</math>
| valign="top" | <math>\operatorname{F2.2d.}</math>
| <math>\downharpoonleft \operatorname{not}~ s \downharpoonright</math>
| valign="top" |
<math>\begin{array}{cccl}
\upharpoonleft \operatorname{Der}^L \upharpoonright
| <math>=\!</math>
& = & \{ & (x, y, z) \in S \times I \times \underline\mathbb{B} ~:~ z = \\
| <math>(p)\!</math>
& & & \begin{array}{cccl}
|- style="height:52px"
\underset{o \in O}{\operatorname{Conj}} \\
& \downharpoonleft & ( & \upharpoonleft \operatorname{Den}^L x \upharpoonright (o) \\
& & = & \upharpoonleft \operatorname{Den}^L y \upharpoonright (o) \\
& & ) & \\
& \downharpoonright & & \\
\end{array} \\
& & \} & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" |
<math>\operatorname{F2.2d~:~Log}</math>
|- style="height:20px"
| colspan="3" |
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:100px"
|
|
| align="left" | <math>\text{L2b}_{4}.\!</math>
| valign="top" | <math>\operatorname{F2.2e.}</math>
| <math>\downharpoonleft s ~\operatorname{and~not}~ t \downharpoonright</math>
| valign="top" |
<math>\begin{array}{cccl}
\upharpoonleft \operatorname{Der}^L \upharpoonright
| <math>=\!</math>
& = & \{ & (x, y, z) \in S \times I \times \underline\mathbb{B} ~:~ z = \\
| <math>p (q)\!</math>
& & & \begin{array}{ccl}
|- style="height:52px"
\underset{o \in O}{\operatorname{Conj}} \\
& \underline{((} & \upharpoonleft \operatorname{Den}^L x \upharpoonright (o) \\
& , & \upharpoonleft \operatorname{Den}^L y \upharpoonright (o) \\
& \underline{))} & \\
\end{array} \\
& & \} & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" |
<math>\operatorname{F2.2e~:~Log}</math>
|- style="height:20px"
| colspan="3" |
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:100px"
|
|
| align="left" | <math>\text{L2b}_{5}.\!</math>
| valign="top" | <math>\operatorname{F2.2f.}</math>
| <math>\downharpoonleft \operatorname{not}~ t \downharpoonright</math>
| valign="top" |
<math>\begin{array}{cccl}
\upharpoonleft \operatorname{Der}^L \upharpoonright
| <math>=\!</math>
& = & \{ & (x, y, z) \in S \times I \times \underline\mathbb{B} ~:~ z = \\
| <math>(q)\!</math>
& & & \begin{array}{cll}
|- style="height:52px"
\underset{o \in O}{\operatorname{Conj}} \\
|
& \underline{((} & \upharpoonleft \operatorname{Den}^L x \upharpoonright \\
| align="left" | <math>\text{L2b}_{6}.\!</math>
& , & \upharpoonleft \operatorname{Den}^L y \upharpoonright \\
| <math>\downharpoonleft s ~\operatorname{or}~ t, ~\operatorname{not~both} \downharpoonright</math>
& \underline{))}^\$ & (o) \\
| <math>=\!</math>
\end{array} \\
| <math>(\downharpoonleft s \downharpoonright ~,~ \downharpoonleft t \downharpoonright)</math>
& & \} & \\
| <math>=\!</math>
\end{array}</math>
| <math>(p, q)\!</math>
| style="border-left:1px solid black; text-align:center" |
|- style="height:52px"
<math>\operatorname{F2.2f~:~$~}</math>
|}
|}
<br>
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:50px; text-align:center"
| style="width:80%" |
| style="width:20%; border-left:1px solid black" | <math>\operatorname{Fact~2.3}</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:50px"
| width="2%" style="border-top:1px solid black" |
| width="12%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="66%" style="border-top:1px solid black" | <math>L ~\subseteq~ O \times S \times I</math>
| width="20%" style="border-top:1px solid black; border-left:1px solid black" |
|- style="height:50px"
|
|
| <math>\text{then}\!</math>
| <math>\downharpoonleft \operatorname{not~both}~ s ~\operatorname{and}~ t \downharpoonright</math>
| <math>\text{the following are equivalent:}\!</math>
| <math>=\!</math>
| style="border-left:1px solid black" |
| <math>(\downharpoonleft s \downharpoonright ~ \downharpoonleft t \downharpoonright)</math>
|}
| <math>=\!</math>
|-
| <math>(p q)\!</math>
|
|- style="height:52px"
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:10px"
| width="2%" style="border-top:1px solid black" |
| width="12%" style="border-top:1px solid black" |
| width="66%" style="border-top:1px solid black" |
| width="20%" style="border-top:1px solid black; border-left:1px solid black" |
|- style="height:100px"
|
|
| align="left" | <math>\text{L2b}_{8}.\!</math>
| valign="top" | <math>\operatorname{F2.3a.}</math>
| <math>\downharpoonleft s ~\operatorname{and}~ t \downharpoonright</math>
| valign="top" |
<math>\begin{array}{cccl}
\operatorname{Der}^L
| <math>=\!</math>
& = & \{ & (x, y) \in S \times I ~: \\
| <math>p q\!</math>
& & & \begin{array}{ccl}
|- style="height:52px"
\underset{o \in O}{\operatorname{Conj}} \\
& ( & \upharpoonleft \operatorname{Den}^L x \upharpoonright (o) \\
& = & \upharpoonleft \operatorname{Den}^L y \upharpoonright (o) \\
& ) & \\
\end{array} \\
& & \} & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" | <math>\operatorname{F2.3a~:~R11a}</math>
|- style="height:20px"
| colspan="3" |
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:100px"
|
|
| align="left" | <math>\text{L2b}_{9}.\!</math>
| valign="top" | <math>\operatorname{F2.3b.}</math>
| <math>\downharpoonleft s ~\operatorname{is~equivalent~to}~ t \downharpoonright</math>
| valign="top" |
<math>\begin{array}{ccccl}
\upharpoonleft \operatorname{Der}^L \upharpoonright (x, y)
| <math>=\!</math>
& = & \downharpoonleft & \underset{o \in O}{\operatorname{Conj}} \\
| <math>((p, q))\!</math>
& & & & \begin{array}{cl}
|- style="height:52px"
( & \upharpoonleft \operatorname{Den}^L x \upharpoonright (o) \\
= & \upharpoonleft \operatorname{Den}^L y \upharpoonright (o) \\
) & \\
\end{array} \\
& & \downharpoonright & & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" | <math>\operatorname{F2.3b~:~R11d}</math>
|- style="height:20px"
| colspan="3" |
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:100px"
|
|
| align="left" | <math>\text{L2b}_{10}.\!</math>
| valign="top" | <math>\operatorname{F2.3c.}</math>
| <math>\downharpoonleft t \downharpoonright</math>
| valign="top" |
| <math>=\!</math>
<math>\begin{array}{ccccl}
\upharpoonleft \operatorname{Der}^L \upharpoonright (x, y)
| <math>=\!</math>
& = & \underset{o \in O}{\operatorname{Conj}} \\
| <math>q\!</math>
& & & \begin{array}{ccl}
|- style="height:52px"
\downharpoonleft & ( & \upharpoonleft \operatorname{Den}^L x \upharpoonright (o) \\
& = & \upharpoonleft \operatorname{Den}^L y \upharpoonright (o) \\
& ) & \\
\downharpoonright & & \\
\end{array} \\
& & & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" | <math>\operatorname{F2.3c~:~Log}</math></p>
|- style="height:20px"
| colspan="3" |
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:100px"
|
|
| align="left" | <math>\text{L2b}_{11}.\!</math>
| valign="top" | <math>\operatorname{F2.3d.}</math>
| <math>\downharpoonleft s ~\operatorname{implies}~ t \downharpoonright</math>
| valign="top" |
<math>\begin{array}{ccccl}
\upharpoonleft \operatorname{Der}^L \upharpoonright (x, y)
| <math>=\!</math>
& = & \underset{o \in O}{\operatorname{Conj}} \\
| <math>(p (q))\!</math>
& & & \begin{array}{ccl}
|- style="height:52px"
\downharpoonleft & ( & \upharpoonleft \operatorname{Den}^L \upharpoonright (o, x) \\
& = & \upharpoonleft \operatorname{Den}^L \upharpoonright (o, y) \\
& ) & \\
\downharpoonright & & \\
\end{array} \\
& & & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" | <math>\operatorname{F2.3d~:~Def}</math>
|- style="height:20px"
| colspan="3" |
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:100px"
|
|
| align="left" | <math>\text{L2b}_{12}.\!</math>
| valign="top" | <math>\operatorname{F2.3e.}</math>
| <math>\downharpoonleft s \downharpoonright</math>
| valign="top" |
| <math>=\!</math>
<math>\begin{array}{ccccl}
\upharpoonleft \operatorname{Der}^L \upharpoonright (x, y)
| <math>=\!</math>
& = & \underset{o \in O}{\operatorname{Conj}} \\
| <math>p\!</math>
& & & \begin{array}{cl}
|- style="height:52px"
\underline{((} & \upharpoonleft \operatorname{Den}^L \upharpoonright (o, x) \\
, & \upharpoonleft \operatorname{Den}^L \upharpoonright (o, y) \\
\underline{))} & \\
\end{array} \\
& & & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" |
<p><math>\operatorname{F2.3e~:~Log}</math></p>
<p><math>\operatorname{F2.3e~:~D10b}</math></p>
|- style="height:20px"
| colspan="3" |
| style="border-left:1px solid black; text-align:center" | <math>::\!</math>
|- style="height:100px"
|
|
| align="left" | <math>\text{L2b}_{13}.\!</math>
| valign="top" | <math>\operatorname{F2.3f.}</math>
| <math>\downharpoonleft s ~\operatorname{is~implied~by}~ t \downharpoonright</math>
| valign="top" |
<math>\begin{array}{ccccl}
\upharpoonleft \operatorname{Der}^L \upharpoonright (x, y)
& = & \underset{o \in O}{\operatorname{Conj}} \\
& & & \begin{array}{cl}
|- style="height:52px"
\underline{((} & \upharpoonleft L_{OS} \upharpoonright (o, x) \\
, & \upharpoonleft L_{OS} \upharpoonright (o, y) \\
\underline{))} & \\
| <math>\downharpoonleft s ~\operatorname{or}~ t \downharpoonright</math>
\end{array} \\
& & & \\
\end{array}</math>
| style="border-left:1px solid black; text-align:center" | <math>\operatorname{F2.3f~:~D10a}</math>
| <math>((p)(q))\!</math>
|}
|- style="height:52px"
|}
<br>
=====1.3.12.3. Digression on Derived Relations=====
A better understanding of derived equivalence relations (DERs) can be achieved by placing their constructions within a more general context and thus comparing the associated type of derivation operation, namely, the one that takes a triadic relation <math>L\!</math> into a dyadic relation <math>\operatorname{Der}(L),</math> with other types of operations on triadic relations. The proper setting would permit a comparative study of all their constructions from a basic set of projections and a full array of compositions on dyadic relations.
| <math>((~))</math>
To that end, let the derivation <math>\operatorname{Der}(L)</math> be expressed in the following way:
{| align="center" cellpadding="8" width="90%"
| <math>\upharpoonleft \operatorname{Der}(L) \upharpoonright (x, y) \quad = \quad \underset{o \in O}{\operatorname{Conj}} ~\underline{((}~ \upharpoonleft L_{SO} \upharpoonright (x, o) ~,~ \upharpoonleft L_{OS} \upharpoonright (o, y) ~\underline{))}~.</math>
|}
From this may be abstracted a way of composing two dyadic relations that have a domain in common. For example, let <math>P \subseteq X \times M</math> and <math>Q \subseteq M \times Y</math> be dyadic relations that have the middle domain <math>M\!</math> in common. Then we may define a form of composition, notated <math>P \circeq Q,</math> where <math>P \circeq Q ~\subseteq~ X \times Y</math> is defined as follows:
{| align="center" cellpadding="8" width="90%"
| <math>\upharpoonleft P \circeq Q \upharpoonright (x, y) \quad = \quad \underset{m \in M}{\operatorname{Conj}} ~\underline{((}~ \upharpoonleft P \upharpoonright (x, m) ~,~ \upharpoonleft Q \upharpoonright (m, y) ~\underline{))}~.</math>
|}
|}
Compare this with the usual form of composition, typically notated <math>P \circ Q</math> and defined as follows:
{| align="center" cellpadding="8" width="90%"
| <math>\upharpoonleft P \circ Q \upharpoonright (x, y) \quad = \quad \underset{m \in M}{\operatorname{Disj}} ~\upharpoonleft P \upharpoonright (x, m) ~\cdot~ \upharpoonleft Q \upharpoonright (m, y)~.</math>
|}
|}
==Appendices==
===Geometric Translation Rule 2===
===Logical Translation Rule 1===
<br>
<br>
{| align="center" cellpadding="0" cellspacing="0" width="100%"
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:48px; text-align:right"
|- style="height:48px; text-align:right"
| width="98%" | <math>\text{Geometric Translation Rule 2}\!</math>
| width="98%" | <math>\text{Logical Translation Rule 1}\!</math>
| width="2%" |
| width="2%" |
|}
|}
|- style="height:48px"
|- style="height:48px"
| width="2%" style="border-top:1px solid black" |
| width="2%" style="border-top:1px solid black" |
| width="14%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="18%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="84%" style="border-top:1px solid black" | <math>P, Q \subseteq X</math>
| width="80%" style="border-top:1px solid black" |
<math>s ~\text{is a sentence about things in the universe X}</math>
|- style="height:48px"
|- style="height:48px"
|
|
| <math>\text{and}\!</math>
| <math>\text{and}\!</math>
| <math>p, q ~:~ X \to \underline\mathbb{B}</math>
| <math>p ~\text{is a proposition} ~:~ X \to \underline\mathbb{B}</math>
|- style="height:48px"
|- style="height:48px"
|
|
|- style="height:48px"
|- style="height:48px"
|
|
| <math>\text{G2a.}\!</math>
| <math>\text{L1a.}\!</math>
| <math>\upharpoonleft P \upharpoonright ~=~ p \quad \operatorname{and} \quad \upharpoonleft Q \upharpoonright ~=~ q</math>
| <math>\downharpoonleft s \downharpoonright ~=~ p</math>
|- style="height:48px"
|- style="height:48px"
|
|
|- style="height:52px"
|- style="height:52px"
| width="2%" style="border-top:1px solid black" |
| width="2%" style="border-top:1px solid black" |
| width="14%" style="border-top:1px solid black" align="left" | <math>\text{G2b}_{0}.\!</math>
| width="18%" style="border-top:1px solid black" align="left" | <math>\text{L1b}_{00}.\!</math>
| width="32%" style="border-top:1px solid black" |
| width="20%" style="border-top:1px solid black" |
<math>\upharpoonleft \varnothing \upharpoonright</math>
<math>\downharpoonleft \operatorname{false} \downharpoonright</math>
| width="4%" style="border-top:1px solid black" | <math>=\!</math>
| width="5%" style="border-top:1px solid black" | <math>=\!</math>
| width="28%" style="border-top:1px solid black" | <math>(~)</math>
| width="20%" style="border-top:1px solid black" | <math>(~)</math>
| width="4%" style="border-top:1px solid black" | <math>=\!</math>
| width="5%" style="border-top:1px solid black" | <math>=\!</math>
| width="16%" style="border-top:1px solid black" | <math>(~)</math>
| width="30%" style="border-top:1px solid black" |
<math>\underline{0} ~:~ X \to \underline\mathbb{B}</math>
|- style="height:52px"
|- style="height:52px"
|
|
| align="left" | <math>\text{G2b}_{1}.\!</math>
| align="left" | <math>\text{L1b}_{01}.\!</math>
| <math>\upharpoonleft \overline{P} ~\cap~ \overline{Q} \upharpoonright</math>
| <math>\downharpoonleft \operatorname{not}~ s \downharpoonright</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>(\upharpoonleft P \upharpoonright)(\upharpoonleft Q \upharpoonright)</math>
| <math>(\downharpoonleft s \downharpoonright)</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>(p)(q)\!</math>
| <math>(p) ~:~ X \to \underline\mathbb{B}</math>
|- style="height:52px"
|- style="height:52px"
|
|
| align="left" | <math>\text{G2b}_{2}.\!</math>
| align="left" | <math>\text{L1b}_{10}.\!</math>
| <math>\upharpoonleft \overline{P} ~\cap~ Q \upharpoonright</math>
| <math>\downharpoonleft s \downharpoonright</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>(\upharpoonleft P \upharpoonright) \upharpoonleft Q \upharpoonright</math>
| <math>\downharpoonleft s \downharpoonright</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>(p) q\!</math>
| <math>p ~:~ X \to \underline\mathbb{B}</math>
|- style="height:52px"
|- style="height:52px"
|
|
| align="left" | <math>\text{G2b}_{3}.\!</math>
| align="left" | <math>\text{L1b}_{11}.\!</math>
| <math>\upharpoonleft \overline{P} \upharpoonright</math>
| <math>\downharpoonleft \operatorname{true} \downharpoonright</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>(\upharpoonleft P \upharpoonright)</math>
| <math>((~))</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>(p)\!</math>
| <math>\underline{1} ~:~ X \to \underline\mathbb{B}</math>
|- style="height:52px"
|}
|
|}
| align="left" | <math>\text{G2b}_{4}.\!</math>
| <math>\upharpoonleft P ~\cap~ \overline{Q} \upharpoonright</math>
<br>
| <math>=\!</math>
| <math>\upharpoonleft P \upharpoonright (\upharpoonleft Q \upharpoonright)</math>
===Geometric Translation Rule 1===
| <math>=\!</math>
| <math>p (q)\!</math>
<br>
|- style="height:52px"
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:48px; text-align:right"
| width="98%" | <math>\text{Geometric Translation Rule 1}\!</math>
| width="2%" |
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:48px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="80%" style="border-top:1px solid black" | <math>Q \subseteq X</math>
|- style="height:48px"
|
|
| <math>\text{and}\!</math>
| <math>\upharpoonleft \overline{Q} \upharpoonright</math>
| <math>p ~:~ X \to \underline\mathbb{B}</math>
|- style="height:48px"
|- style="height:52px"
|
|
| align="left" | <math>\text{G2b}_{6}.\!</math>
| <math>\text{such that:}\!</math>
| <math>\upharpoonleft P ~+~ Q \upharpoonright</math>
|
|- style="height:48px"
|
| <math>\text{G1a.}\!</math>
| <math>\upharpoonleft Q \upharpoonright ~=~ p</math>
|- style="height:48px"
|
| <math>\text{then}\!</math>
| <math>\text{the following equations hold:}\!</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" style="text-align:center" width="100%"
|- style="height:52px"
| width="2%" style="border-top:1px solid black" |
| width="18%" style="border-top:1px solid black" align="left" | <math>\text{G1b}_{00}.\!</math>
| width="20%" style="border-top:1px solid black" |
<math>\upharpoonleft \varnothing \upharpoonright</math>
| width="5%" style="border-top:1px solid black" | <math>=\!</math>
| width="20%" style="border-top:1px solid black" | <math>(~)</math>
| width="5%" style="border-top:1px solid black" | <math>=\!</math>
| width="30%" style="border-top:1px solid black" |
<math>\underline{0} ~:~ X \to \underline\mathbb{B}</math>
|- style="height:52px"
|
| align="left" | <math>\text{G1b}_{01}.\!</math>
| <math>\upharpoonleft {}^{_\sim} Q \upharpoonright</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>(\upharpoonleft P \upharpoonright ~,~ \upharpoonleft Q \upharpoonright)</math>
| <math>(\upharpoonleft Q \upharpoonright)</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>(p, q)\!</math>
| <math>(p) ~:~ X \to \underline\mathbb{B}</math>
|- style="height:52px"
|- style="height:52px"
|
|
| align="left" | <math>\text{G2b}_{7}.\!</math>
| align="left" | <math>\text{G1b}_{10}.\!</math>
| <math>\upharpoonleft Q \upharpoonright</math>
| <math>\upharpoonleft Q \upharpoonright</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>\upharpoonleft Q \upharpoonright</math>
| <math>\upharpoonleft Q \upharpoonright</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>q\!</math>
| <math>p ~:~ X \to \underline\mathbb{B}</math>
|- style="height:52px"
|- style="height:52px"
|
|
| align="left" | <math>\text{G2b}_{11}.\!</math>
| align="left" | <math>\text{G1b}_{11}.\!</math>
| <math>\upharpoonleft \overline{P ~\cap~ \overline{Q}} \upharpoonright</math>
| <math>\upharpoonleft X \upharpoonright</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>(\upharpoonleft P \upharpoonright (\upharpoonleft Q \upharpoonright))</math>
| <math>((~))</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>(p (q))\!</math>
| <math>\underline{1} ~:~ X \to \underline\mathbb{B}</math>
|- style="height:52px"
|}
|}
<br>
===Logical Translation Rule 2===
<br>
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:48px; text-align:right"
| width="98%" | <math>\text{Logical Translation Rule 2}\!</math>
| width="2%" |
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:48px"
| width="2%" style="border-top:1px solid black" |
| width="14%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="84%" style="border-top:1px solid black" |
<math>s, t ~\text{are sentences about things in the universe}~ X</math>
|- style="height:48px"
|
|
| align="left" | <math>\text{G2b}_{12}.\!</math>
| <math>\text{and}\!</math>
| <math>\upharpoonleft P \upharpoonright</math>
| <math>p, q ~\text{are propositions} ~:~ X \to \underline\mathbb{B}</math>
| <math>=\!</math>
|- style="height:48px"
| <math>\upharpoonleft P \upharpoonright</math>
|
| <math>=\!</math>
| <math>\text{such that:}\!</math>
| <math>p\!</math>
|
|- style="height:48px"
|
| <math>\text{L2a.}\!</math>
| <math>\downharpoonleft s \downharpoonright ~=~ p \quad \operatorname{and} \quad \downharpoonleft t \downharpoonright ~=~ q</math>
|- style="height:48px"
|
| <math>\text{then}\!</math>
| <math>\text{the following equations hold:}\!</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" style="text-align:center" width="100%"
|- style="height:52px"
| width="2%" style="border-top:1px solid black" |
| width="14%" style="border-top:1px solid black" align="left" | <math>\text{L2b}_{0}.\!</math>
| width="32%" style="border-top:1px solid black" |
<math>\downharpoonleft \operatorname{false} \downharpoonright</math>
| width="4%" style="border-top:1px solid black" | <math>=\!</math>
| width="28%" style="border-top:1px solid black" | <math>(~)</math>
| width="4%" style="border-top:1px solid black" | <math>=\!</math>
| width="16%" style="border-top:1px solid black" | <math>(~)</math>
|- style="height:52px"
|- style="height:52px"
|
|
| align="left" | <math>\text{G2b}_{13}.\!</math>
| align="left" | <math>\text{L2b}_{1}.\!</math>
| <math>\upharpoonleft \overline{\overline{P} ~\cap~ Q} \upharpoonright</math>
| <math>\downharpoonleft \operatorname{neither}~ s ~\operatorname{nor}~ t \downharpoonright</math>
| <math>=\!</math>
| <math>(\downharpoonleft s \downharpoonright)(\downharpoonleft t \downharpoonright)</math>
| <math>=\!</math>
| <math>(p)(q)\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{L2b}_{2}.\!</math>
| <math>\downharpoonleft \operatorname{not}~ s ~\operatorname{but}~ t \downharpoonright</math>
| <math>=\!</math>
| <math>(\downharpoonleft s \downharpoonright) \downharpoonleft t \downharpoonright</math>
| <math>=\!</math>
| <math>(p) q\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{L2b}_{3}.\!</math>
| <math>\downharpoonleft \operatorname{not}~ s \downharpoonright</math>
| <math>=\!</math>
| <math>(\downharpoonleft s \downharpoonright)</math>
| <math>=\!</math>
| <math>(p)\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{L2b}_{4}.\!</math>
| <math>\downharpoonleft s ~\operatorname{and~not}~ t \downharpoonright</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>((\upharpoonleft P \upharpoonright) \upharpoonleft Q \upharpoonright)</math>
| <math>\downharpoonleft s \downharpoonright (\downharpoonleft t \downharpoonright)</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>((p) q)\!</math>
| <math>p (q)\!</math>
|- style="height:52px"
|- style="height:52px"
|
|
| align="left" | <math>\text{G2b}_{14}.\!</math>
| align="left" | <math>\text{L2b}_{5}.\!</math>
| <math>\upharpoonleft P ~\cup~ Q \upharpoonright</math>
| <math>\downharpoonleft \operatorname{not}~ t \downharpoonright</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>((\upharpoonleft P \upharpoonright)(\upharpoonleft Q \upharpoonright))</math>
| <math>(\downharpoonleft t \downharpoonright)</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>((p)(q))\!</math>
| <math>(q)\!</math>
|- style="height:52px"
|- style="height:52px"
|
|
| align="left" | <math>\text{G2b}_{15}.\!</math>
| align="left" | <math>\text{L2b}_{6}.\!</math>
| <math>\upharpoonleft X \upharpoonright</math>
| <math>\downharpoonleft s ~\operatorname{or}~ t, ~\operatorname{not~both} \downharpoonright</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>((~))</math>
| <math>(\downharpoonleft s \downharpoonright ~,~ \downharpoonleft t \downharpoonright)</math>
| <math>=\!</math>
| <math>=\!</math>
| <math>((~))</math>
| <math>(p, q)\!</math>
|}
|- style="height:52px"
|}
|
| align="left" | <math>\text{L2b}_{7}.\!</math>
<br>
| <math>\downharpoonleft \operatorname{not~both}~ s ~\operatorname{and}~ t \downharpoonright</math>
| <math>=\!</math>
==Document History==
| <math>(\downharpoonleft s \downharpoonright ~ \downharpoonleft t \downharpoonright)</math>
| <math>=\!</math>
| <math>(p q)\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{L2b}_{8}.\!</math>
| <math>\downharpoonleft s ~\operatorname{and}~ t \downharpoonright</math>
| <math>=\!</math>
| <math>\downharpoonleft s \downharpoonright ~ \downharpoonleft t \downharpoonright</math>
| <math>=\!</math>
| <math>p q\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{L2b}_{9}.\!</math>
| <math>\downharpoonleft s ~\operatorname{is~equivalent~to}~ t \downharpoonright</math>
| <math>=\!</math>
| <math>((\downharpoonleft s \downharpoonright ~,~ \downharpoonleft t \downharpoonright))</math>
| <math>=\!</math>
| <math>((p, q))\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{L2b}_{10}.\!</math>
| <math>\downharpoonleft t \downharpoonright</math>
| <math>=\!</math>
| <math>\downharpoonleft t \downharpoonright</math>
| <math>=\!</math>
| <math>q\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{L2b}_{11}.\!</math>
| <math>\downharpoonleft s ~\operatorname{implies}~ t \downharpoonright</math>
| <math>=\!</math>
| <math>(\downharpoonleft s \downharpoonright (\downharpoonleft t \downharpoonright))</math>
| <math>=\!</math>
| <math>(p (q))\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{L2b}_{12}.\!</math>
| <math>\downharpoonleft s \downharpoonright</math>
| <math>=\!</math>
| <math>\downharpoonleft s \downharpoonright</math>
| <math>=\!</math>
| <math>p\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{L2b}_{13}.\!</math>
| <math>\downharpoonleft s ~\operatorname{is~implied~by}~ t \downharpoonright</math>
| <math>=\!</math>
| <math>((\downharpoonleft s \downharpoonright) \downharpoonleft t \downharpoonright)</math>
| <math>=\!</math>
| <math>((p) q)\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{L2b}_{14}.\!</math>
| <math>\downharpoonleft s ~\operatorname{or}~ t \downharpoonright</math>
| <math>=\!</math>
| <math>((\downharpoonleft s \downharpoonright)(\downharpoonleft t \downharpoonright))</math>
| <math>=\!</math>
| <math>((p)(q))\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{L2b}_{15}.\!</math>
| <math>\downharpoonleft \operatorname{true} \downharpoonright</math>
| <math>=\!</math>
| <math>((~))</math>
| <math>=\!</math>
| <math>((~))</math>
|}
|}
<br>
===Geometric Translation Rule 2===
<br>
{| align="center" cellpadding="0" cellspacing="0" style="border-left:1px solid black; border-top:1px solid black; border-right:1px solid black; border-bottom:1px solid black" width="90%"
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:48px; text-align:right"
| width="98%" | <math>\text{Geometric Translation Rule 2}\!</math>
| width="2%" |
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" width="100%"
|- style="height:48px"
| width="2%" style="border-top:1px solid black" |
| width="14%" style="border-top:1px solid black" | <math>\text{If}\!</math>
| width="84%" style="border-top:1px solid black" | <math>P, Q \subseteq X</math>
|- style="height:48px"
|
| <math>\text{and}\!</math>
| <math>p, q ~:~ X \to \underline\mathbb{B}</math>
|- style="height:48px"
|
| <math>\text{such that:}\!</math>
|
|- style="height:48px"
|
| <math>\text{G2a.}\!</math>
| <math>\upharpoonleft P \upharpoonright ~=~ p \quad \operatorname{and} \quad \upharpoonleft Q \upharpoonright ~=~ q</math>
|- style="height:48px"
|
| <math>\text{then}\!</math>
| <math>\text{the following equations hold:}\!</math>
|}
|-
|
{| align="center" cellpadding="0" cellspacing="0" style="text-align:center" width="100%"
|- style="height:52px"
| width="2%" style="border-top:1px solid black" |
| width="14%" style="border-top:1px solid black" align="left" | <math>\text{G2b}_{0}.\!</math>
| width="32%" style="border-top:1px solid black" |
<math>\upharpoonleft \varnothing \upharpoonright</math>
| width="4%" style="border-top:1px solid black" | <math>=\!</math>
| width="28%" style="border-top:1px solid black" | <math>(~)</math>
| width="4%" style="border-top:1px solid black" | <math>=\!</math>
| width="16%" style="border-top:1px solid black" | <math>(~)</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{1}.\!</math>
| <math>\upharpoonleft \overline{P} ~\cap~ \overline{Q} \upharpoonright</math>
| <math>=\!</math>
| <math>(\upharpoonleft P \upharpoonright)(\upharpoonleft Q \upharpoonright)</math>
| <math>=\!</math>
| <math>(p)(q)\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{2}.\!</math>
| <math>\upharpoonleft \overline{P} ~\cap~ Q \upharpoonright</math>
| <math>=\!</math>
| <math>(\upharpoonleft P \upharpoonright) \upharpoonleft Q \upharpoonright</math>
| <math>=\!</math>
| <math>(p) q\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{3}.\!</math>
| <math>\upharpoonleft \overline{P} \upharpoonright</math>
| <math>=\!</math>
| <math>(\upharpoonleft P \upharpoonright)</math>
| <math>=\!</math>
| <math>(p)\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{4}.\!</math>
| <math>\upharpoonleft P ~\cap~ \overline{Q} \upharpoonright</math>
| <math>=\!</math>
| <math>\upharpoonleft P \upharpoonright (\upharpoonleft Q \upharpoonright)</math>
| <math>=\!</math>
| <math>p (q)\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{5}.\!</math>
| <math>\upharpoonleft \overline{Q} \upharpoonright</math>
| <math>=\!</math>
| <math>(\upharpoonleft Q \upharpoonright)</math>
| <math>=\!</math>
| <math>(q)\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{6}.\!</math>
| <math>\upharpoonleft P ~+~ Q \upharpoonright</math>
| <math>=\!</math>
| <math>(\upharpoonleft P \upharpoonright ~,~ \upharpoonleft Q \upharpoonright)</math>
| <math>=\!</math>
| <math>(p, q)\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{7}.\!</math>
| <math>\upharpoonleft \overline{P ~\cap~ Q} \upharpoonright</math>
| <math>=\!</math>
| <math>(\upharpoonleft P \upharpoonright ~ \upharpoonleft Q \upharpoonright)</math>
| <math>=\!</math>
| <math>(p q)\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{8}.\!</math>
| <math>\upharpoonleft P ~\cap~ Q \upharpoonright</math>
| <math>=\!</math>
| <math>\upharpoonleft P \upharpoonright ~ \upharpoonleft Q \upharpoonright</math>
| <math>=\!</math>
| <math>p q\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{9}.\!</math>
| <math>\upharpoonleft \overline{P ~+~ Q} \upharpoonright</math>
| <math>=\!</math>
| <math>((\upharpoonleft P \upharpoonright ~,~ \upharpoonleft Q \upharpoonright))</math>
| <math>=\!</math>
| <math>((p, q))\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{10}.\!</math>
| <math>\upharpoonleft Q \upharpoonright</math>
| <math>=\!</math>
| <math>\upharpoonleft Q \upharpoonright</math>
| <math>=\!</math>
| <math>q\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{11}.\!</math>
| <math>\upharpoonleft \overline{P ~\cap~ \overline{Q}} \upharpoonright</math>
| <math>=\!</math>
| <math>(\upharpoonleft P \upharpoonright (\upharpoonleft Q \upharpoonright))</math>
| <math>=\!</math>
| <math>(p (q))\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{12}.\!</math>
| <math>\upharpoonleft P \upharpoonright</math>
| <math>=\!</math>
| <math>\upharpoonleft P \upharpoonright</math>
| <math>=\!</math>
| <math>p\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{13}.\!</math>
| <math>\upharpoonleft \overline{\overline{P} ~\cap~ Q} \upharpoonright</math>
| <math>=\!</math>
| <math>((\upharpoonleft P \upharpoonright) \upharpoonleft Q \upharpoonright)</math>
| <math>=\!</math>
| <math>((p) q)\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{14}.\!</math>
| <math>\upharpoonleft P ~\cup~ Q \upharpoonright</math>
| <math>=\!</math>
| <math>((\upharpoonleft P \upharpoonright)(\upharpoonleft Q \upharpoonright))</math>
| <math>=\!</math>
| <math>((p)(q))\!</math>
|- style="height:52px"
|
| align="left" | <math>\text{G2b}_{15}.\!</math>
| <math>\upharpoonleft X \upharpoonright</math>
| <math>=\!</math>
| <math>((~))</math>
| <math>=\!</math>
| <math>((~))</math>
|}
|}
<br>
==Document History==
<pre>
| Subject: Inquiry Driven Systems : An Inquiry Into Inquiry
| Contact: Jon Awbrey
| Version: Draft 8.70
| Created: 23 Jun 1996
| Revised: 06 Jan 2002
| Advisor: M.A. Zohdy
| Setting: Oakland University, Rochester, Michigan, USA
| Excerpt: Section 1.3.10 (Recurring Themes)
| Excerpt: Subsections 1.3.10.8 - 1.3.10.13
</pre>
***