Line 1,221: |
Line 1,221: |
| As a standard way of dealing with these situations, the following scheme of notation suggests a way of extending any alphabet of logical features through as many temporal moments as a particular order of analysis may demand. The lexical operators <math>\operatorname{p}^k</math> and <math>\operatorname{Q}^k</math> are convenient in many contexts where the accumulation of prime symbols and union symbols would otherwise be cumbersome. | | As a standard way of dealing with these situations, the following scheme of notation suggests a way of extending any alphabet of logical features through as many temporal moments as a particular order of analysis may demand. The lexical operators <math>\operatorname{p}^k</math> and <math>\operatorname{Q}^k</math> are convenient in many contexts where the accumulation of prime symbols and union symbols would otherwise be cumbersome. |
| | | |
− | <font face="courier new">
| + | {| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:left; width:96%" |
− | {| align="center" border="1" cellpadding="4" cellspacing="0" style="text-align:left; width:96%" | |
| |+ '''Table 10. A Realm of Intentional Features''' | | |+ '''Table 10. A Realm of Intentional Features''' |
− | | width=50% |
| + | | |
− | {| cellpadding="4"
| + | <p><math>\begin{array}{lllll} |
− | | p<sup>0</sup><font face="lucida calligraphy">A</font>
| + | \operatorname{p}^0 \mathcal{A} |
− | | =
| + | & = & \{ a_1, \ldots, a_n \} |
− | | <font face="lucida calligraphy">A</font>
| + | & = & \mathcal{A} \\ |
− | | =
| + | \operatorname{p}^1 \mathcal{A} |
− | | {''a''<sub>1</sub> ,
| + | & = & \{ a_1^\prime, \ldots, a_n^\prime \} |
− | | …,
| + | & = & \mathcal{A}^\prime \\ |
− | | ''a''<sub>''n''</sub> }
| + | \operatorname{p}^2 \mathcal{A} |
− | |-
| + | & = & \{ a_1^{\prime\prime}, \ldots, a_n^{\prime\prime} \} |
− | | p<sup>1</sup><font face="lucida calligraphy">A</font>
| + | & = & \mathcal{A}^{\prime\prime} \\ |
− | | =
| + | \end{array}</math></p> |
− | | <font face="lucida calligraphy">A</font>′
| + | <p><math>\begin{array}{lll} |
− | | =
| + | \ldots & & \ldots \\ |
− | | {''a''<sub>1</sub>′,
| + | \operatorname{p}^k \mathcal{A} |
− | | …,
| + | & = & \{\operatorname{p}^k a_1, \ldots, \operatorname{p}^k a_n\} \\ |
− | | ''a''<sub>''n''</sub>′}
| + | \end{array}</math></p> |
− | |-
| + | | |
− | | p<sup>2</sup><font face="lucida calligraphy">A</font>
| + | <p><math>\begin{array}{lll} |
− | | =
| + | \operatorname{Q}^0 \mathcal{A} |
− | | <font face="lucida calligraphy">A</font>″
| + | & = & \mathcal{A} \\ |
− | | =
| + | \operatorname{Q}^1 \mathcal{A} |
− | | {''a''<sub>1</sub>″,
| + | & = & \mathcal{A} |
− | | …,
| + | \cup \mathcal{A}' \\ |
− | | ''a''<sub>''n''</sub>″}
| + | \operatorname{Q}^2 \mathcal{A} |
− | |-
| + | & = & \mathcal{A} |
− | | ...
| + | \cup \mathcal{A}' |
− | |
| + | \cup \mathcal{A}'' \\ |
− | |
| + | \ldots & & \ldots \\ |
− | |
| + | \operatorname{Q}^k \mathcal{A} |
− | | ...
| + | & = & \mathcal{A} |
− | |-
| + | \cup \mathcal{A}' |
− | | p<sup>''k''</sup><font face="lucida calligraphy">A</font>
| + | \cup \ldots |
− | | =
| + | \cup \operatorname{p}^k \mathcal{A} \\ |
− | |
| + | \end{array}</math></p> |
− | |
| + | |}<br> |
− | | {p<sup>''k''</sup>''a''<sub>1</sub>,
| |
− | | …, | |
− | | p<sup>''k''</sup>''a''<sub>''n''</sub>}
| |
− | |}
| |
− | | width=50% |
| |
− | {| cellpadding="4" | |
− | | Q<sup>0</sup><font face="lucida calligraphy">A</font>
| |
− | | =
| |
− | | <font face="lucida calligraphy">A</font>
| |
− | |-
| |
− | | Q<sup>1</sup><font face="lucida calligraphy">A</font>
| |
− | | =
| |
− | | <font face="lucida calligraphy">A</font> ∪ <font face="lucida calligraphy">A</font>′
| |
− | |-
| |
− | | Q<sup>2</sup><font face="lucida calligraphy">A</font>
| |
− | | =
| |
− | | <font face="lucida calligraphy">A</font> ∪ <font face="lucida calligraphy">A</font>′ ∪ <font face="lucida calligraphy">A</font>″
| |
− | |-
| |
− | | ...
| |
− | |
| |
− | | ...
| |
− | |-
| |
− | | Q<sup>''k''</sup><font face="lucida calligraphy">A</font>
| |
− | | =
| |
− | | <font face="lucida calligraphy">A</font> ∪ <font face="lucida calligraphy">A</font>′ ∪ … ∪ p<sup>''k''</sup><font face="lucida calligraphy">A</font>
| |
− | |} | |
− | |}
| |
− | </font><br>
| |
| | | |
| The resulting augmentations of our logical basis found a series of discursive universes that may be called the ''intentional extension'' of propositional calculus. The pattern of this extension is analogous to that of the differential extension, which was developed in terms of the operators d<sup>''k''</sup> and E<sup>''k''</sup>, and there is an obvious and natural relation between these two extensions that falls within our purview to explore. In contexts displaying this regular pattern, where a series of domains stretches up from an anchoring domain ''X'' through an indefinite number of higher reaches, I refer to a particular collection of domains based on ''X'' as a ''realm'' of ''X'', and when the succession exhibits a temporal aspect, as a ''reign'' of ''X''. | | The resulting augmentations of our logical basis found a series of discursive universes that may be called the ''intentional extension'' of propositional calculus. The pattern of this extension is analogous to that of the differential extension, which was developed in terms of the operators d<sup>''k''</sup> and E<sup>''k''</sup>, and there is an obvious and natural relation between these two extensions that falls within our purview to explore. In contexts displaying this regular pattern, where a series of domains stretches up from an anchoring domain ''X'' through an indefinite number of higher reaches, I refer to a particular collection of domains based on ''X'' as a ''realm'' of ''X'', and when the succession exhibits a temporal aspect, as a ''reign'' of ''X''. |