Changes

MyWikiBiz, Author Your Legacy — Friday September 05, 2025
Jump to navigationJump to search
'''Author: Jon Awbrey'''
Line 1: Line 1:  
{{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:
Line 432: Line 437:  
'''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.
   −
<br>
  −
  −
<pre>
  −
Value Rule 1
  −
  −
If v, w C B
  −
  −
then "v = w" is a sentence about <v, w> C B2,
  −
  −
[v = w] is a proposition : B2 -> B,
  −
  −
and the following are identical values in B:
  −
  −
V1a. [ v = w ](v, w)
  −
  −
V1b. [ v <=> w ](v, w)
  −
  −
V1c. ((v , w))
  −
</pre>
  −
  −
<br>
  −
  −
<pre>
  −
Value Rule 1
  −
  −
If v, w C B,
  −
  −
then the following are equivalent:
  −
  −
V1a. v = w.
  −
  −
V1b. v <=> w.
  −
  −
V1c. (( v , w )).
  −
</pre>
  −
  −
<br>
  −
  −
<pre>
   
A rule that allows one to turn equivalent sentences into identical propositions:
 
A rule that allows one to turn equivalent sentences into identical propositions:
   −
(S <=> T) <=> ([S] = [T])
+
{| align="center" cellpadding="8" width="90%"
 +
| <math>(S \Leftrightarrow T) \quad \Leftrightarrow \quad (\downharpoonleft S \downharpoonright = \downharpoonleft T \downharpoonright)</math>
 +
|}
   −
Consider [ v = w ](v, w) and [ v(u) = w(u) ](u)
+
Compare:
   −
Value Rule 1
+
{| align="center" cellpadding="8" width="90%"
 
+
| <math>\downharpoonleft v = w \downharpoonright (v, w)</math>
If v, w C B,
+
|-
 
+
| <math>\downharpoonleft v(u) = w(u) \downharpoonright (u)</math>
then the following are identical values in B:
+
|}
 
  −
V1a. [ v = w ]
  −
 
  −
V1b. [ v <=> w ]
  −
 
  −
V1c. (( v , w ))
  −
</pre>
  −
 
  −
<br>
  −
 
  −
<pre>
  −
Value Rule 1
  −
 
  −
If f, g : U -> B,
  −
 
  −
and u C U
  −
 
  −
then the following are identical values in B:
  −
 
  −
V1a. [ f(u) = g(u) ]
  −
 
  −
V1b. [ f(u) <=> g(u) ]
  −
 
  −
V1c. (( f(u) , g(u) ))
  −
</pre>
  −
 
  −
<br>
  −
 
  −
<pre>
  −
Value Rule 1
  −
 
  −
If f, g : U -> B,
     −
then the following are identical propositions on U:
+
'''Editing Note.'''  The last draft I can find has 5 variants for the next box, "Value&nbsp;Rule&nbsp;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:
   −
V1a. [ f = g ]
+
* [http://mywikibiz.com/User:Jon_Awbrey/SCRATCHPAD#Value_Rule_1 Value Rule 1]  
 
  −
V1b. [ f <=> g ]
  −
 
  −
V1c. (( f , g ))$
  −
</pre>
      
<br>
 
<br>
Line 1,588: Line 1,519:  
<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.
Line 2,509: Line 2,440:  
<br>
 
<br>
   −
===Digression on Derived Relations===
+
=====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.
 
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.
Line 3,046: Line 2,977:  
| Excerpt:  Subsections 1.3.10.8 - 1.3.10.13
 
| Excerpt:  Subsections 1.3.10.8 - 1.3.10.13
 
</pre>
 
</pre>
 +
 +
***
12,089

edits

Navigation menu