Line 364: |
Line 364: |
| </ol></ol> | | </ol></ol> |
| | | |
− | <pre>
| + | The definitions of these syntactic operations can now be organized in a slightly better fashion, for both conceptual and computational purposes, by making a few additional conventions and auxiliary definitions. |
− | The definitions of these syntactic operations can now be organized in a slightly | + | |
− | better fashion, for both conceptual and computational purposes, by making a few | + | <ol style="list-style-type:decimal"> |
− | additional conventions and auxiliary definitions. | + | |
| + | <li> |
| + | <p>The conception of the <math>k\!</math>-place concatenation operation can be extended to include its natural ''prequel'':</p> |
| + | |
| + | <p><math>\operatorname{Conc}^0 \ = \ ^{\backprime\backprime\prime\prime}</math> = the empty string.</p> |
| + | |
| + | <p>Next, the construction of the <math>k\!</math>-place concatenation can be broken into stages by means of the following conceptions:</p></li> |
| | | |
− | 1. The conception of the k-place concatenation operation
| + | <ol style="list-style-type:lower-alpha"> |
− | can be extended to include its natural "prequel":
| |
| | | |
− | Conc^0 = "" = the empty string.
| + | <li> |
| + | <p>The ''precatenation'' <math>\operatorname{Prec} (s_1, s_2)</math> of the two strings <math>s_1, s_2\!</math> is the string that is defined as follows:</p> |
| | | |
− | Next, the construction of the k-place concatenation can be
| + | <p><math>\operatorname{Prec} (s_1, s_2) \ = \ s_1 \cdot s_2.</math></p></li> |
− | broken into stages by means of the following conceptions:
| |
| | | |
− | a. The "precatenation" Prec(z_1, z_2) of the two strings
| + | <li> |
− | z_1, z_2 is the string that is defined as follows:
| + | <p>The ''concatenation'' of the sequence of <math>k\!</math> strings <math>s_1, \ldots, s_k\!</math> can now be defined as an iterated precatenation over the sequence of <math>k + 1\!</math> strings that begins with the string <math>s_0 = \operatorname{Conc}^0 \, = \, ^{\backprime\backprime\prime\prime}</math> and then continues on through the other <math>k\!</math> strings:</p></li> |
| | | |
− | Prec(z_1, z_2) = z_1 · z_2.
| + | <ol style="list-style-type:lower-roman"> |
| | | |
− | b. The "concatenation" of the k strings z_1, ..., z_k can now be
| + | <li> |
− | defined as an iterated precatenation over the sequence of k+1
| + | <p><math>\operatorname{Conc}^0_j s_j \ = \ \operatorname{Conc}^0 \ = \ ^{\backprime\backprime\prime\prime}.</math></p></li> |
− | strings that begins with the string z_0 = Conc^0 = "" and then
| |
− | continues on through the other k strings:
| |
| | | |
− | i. Conc^0_j z_j = Conc^0 = "".
| + | <li> |
| + | <p>For <math>k > 0,\!</math></p> |
| | | |
− | ii. For k > 0,
| + | <p><math>\operatorname{Conc}^k_j s_j \ = \ \operatorname{Prec}(\operatorname{Conc}^{k-1}_j s_j, s_k).</math></p></li> |
| | | |
− | Conc^k_j z_j = Prec(Conc^(k-1)_j z_j, z_k).
| + | </ol></ol></ol> |
| | | |
| + | <pre> |
| 2. The conception of the k-place surcatenation operation | | 2. The conception of the k-place surcatenation operation |
| can be extended to include its natural "prequel": | | can be extended to include its natural "prequel": |