Changes

Incidentally, note the inobtrusive appearance of renaming strategies in the progress of this work.  Renaming is the natural operation that substitution is the reverse of.  With these humble beginnings we have reached a birthplace, a native ground, of the [[sign relation]], an irreducible three-place relationship among what is indicated, what happens to indicate it, and all of the equivalent or associated indications we may find or create in reference to it.

Incidentally, note the inobtrusive appearance of renaming strategies in the progress of this work.  Renaming is the natural operation that substitution is the reverse of.  With these humble beginnings we have reached a birthplace, a native ground, of the [[sign relation]], an irreducible three-place relationship among what is indicated, what happens to indicate it, and all of the equivalent or associated indications we may find or create in reference to it.

For example, let <math>^{\backprime\backprime} \operatorname{G} ^{\prime\prime},</math> the interposed interpretant, denote whatever it is, the supposed object, that <math>^{\backprime\backprime} (\operatorname{F}((\operatorname{S}\operatorname{K})\operatorname{S})) ^{\prime\prime},</math> the occurrent sign, denotes.

For example, let "G", the interposed interpretant,

denote whatever it is, the supposed object, that

"(F((SK)S))", the occurrent sign, denotes.

Consider the following data:

Consider the following data:

The parse tree of the term T = ((KK)(((S((KK)S))((SK)S))S))

The parse tree of the term T = ((KK)(((S((KK)S))((SK)S))S))

and the typing of the term T : (A=>(B=>C))=>(B=>(A=>C)).  

and the typing of the term T : (A=>(B=>C))=>(B=>(A=>C)).