Difference between revisions of "User:Jon Awbrey/SCRATCHPAD"
Jon Awbrey (talk | contribs) |
Jon Awbrey (talk | contribs) |
||
(217 intermediate revisions by the same user not shown) | |||
Line 16: | Line 16: | ||
==Epigraph Formats== | ==Epigraph Formats== | ||
+ | |||
+ | <br> | ||
+ | |||
+ | {| cellpadding="2" cellspacing="2" width="100%" | ||
+ | | width="60%" | | ||
+ | | width="40%" | | ||
+ | 'Tis a derivative from me to mine,<br> | ||
+ | And only that I stand for. | ||
+ | |- | ||
+ | | height="50px" | | ||
+ | | valign="top" | — ''Winter's Tale'', 3.2.43–44 | ||
+ | |} | ||
<br> | <br> | ||
Line 89: | Line 101: | ||
| align="right" | — Rousseau, ''Emile, or On Education'', [Rou-1, 34–35] | | align="right" | — Rousseau, ''Emile, or On Education'', [Rou-1, 34–35] | ||
|} | |} | ||
+ | |||
+ | <br> | ||
+ | |||
+ | ==Division Styles== | ||
+ | |||
+ | <br> | ||
+ | |||
+ | <div class="references-small"> | ||
+ | # Able | ||
+ | # Baker | ||
+ | # Charlie | ||
+ | </div> | ||
+ | |||
+ | <br> | ||
+ | |||
+ | <font face="georgia"> | ||
+ | # Able | ||
+ | # Baker | ||
+ | # Charlie | ||
+ | </font> | ||
<br> | <br> | ||
Line 96: | Line 128: | ||
<br> | <br> | ||
− | {| align="center" cellpadding=" | + | {| align="center" cellpadding="8" width="90%" <!--QUOTE--> |
| | | | ||
<p>Now, I ask, how is it that anything can be done with a symbol, without reflecting upon the conception, much less imagining the object that belongs to it? It is simply because the symbol has acquired a nature, which may be described thus, that when it is brought before the mind certain principles of its use — whether reflected on or not — by association immediately regulate the action of the mind; and these may be regarded as laws of the symbol itself which it cannot ''as a symbol'' transgress. (Peirce, CE 1, 173).</p> | <p>Now, I ask, how is it that anything can be done with a symbol, without reflecting upon the conception, much less imagining the object that belongs to it? It is simply because the symbol has acquired a nature, which may be described thus, that when it is brought before the mind certain principles of its use — whether reflected on or not — by association immediately regulate the action of the mind; and these may be regarded as laws of the symbol itself which it cannot ''as a symbol'' transgress. (Peirce, CE 1, 173).</p> | ||
Line 178: | Line 210: | ||
==Ordered List Formats== | ==Ordered List Formats== | ||
+ | |||
+ | ===Simple=== | ||
+ | |||
+ | <ol style="list-style-type:decimal"> | ||
+ | <li>Item 1</li> | ||
+ | <ol style="list-style-type:lower-alpha"> | ||
+ | <li>Item a</li> | ||
+ | <li>Item b</li> | ||
+ | <li>Item c</li> | ||
+ | </ol> | ||
+ | <li>Item 2</li> | ||
+ | <ol style="list-style-type:lower-latin"> | ||
+ | <li>Item a</li> | ||
+ | <li>Item b</li> | ||
+ | <li>Item c</li> | ||
+ | </ol> | ||
+ | <li>Item 3</li> | ||
+ | </ol> | ||
+ | |||
+ | ===Complex=== | ||
<ol style="list-style-type:decimal"> | <ol style="list-style-type:decimal"> | ||
Line 204: | Line 256: | ||
<li>Item 3</li> | <li>Item 3</li> | ||
</ol> | </ol> | ||
+ | |||
+ | ===Examples=== | ||
+ | |||
+ | ====Example 1==== | ||
+ | |||
+ | In the present case, one can observe the possibility that the author is suggesting the following analogies: | ||
+ | |||
+ | <ol style="list-style-type:decimal"> | ||
+ | |||
+ | <li><p>One analogy says that authoring a text is like piloting a vehicle. This can be written in either one of two ways.</p></li> | ||
+ | |||
+ | <ol style="list-style-type:lower-alpha"> | ||
+ | |||
+ | <li><p>Poet / Poem = Pilot / Boat.</p></li> | ||
+ | <li><p>Poet / Pilot = Poem / Boat.</p></li> | ||
+ | <li><p>Pilot / Poet = Boat / Poem.</p></li> | ||
+ | |||
+ | </ol> | ||
+ | |||
+ | <li>…</li> | ||
+ | |||
+ | </ol> | ||
+ | |||
+ | ====Example 2==== | ||
+ | |||
+ | In this way, an epitext can serve a couple of functions within a text: | ||
+ | |||
+ | <ol style="list-style-type:decimal"> | ||
+ | |||
+ | <li><p>The epitext maintains an internal model of the informal context, the actual, intended, or likely "context of interpretation" (COI), or the typical "situation of communication" (SOC) that prevails in a given society of interpretive agents. It does this by preserving a constant but gentle reminder of the type of text that ultimately demands to be understood within this social context. In other words, it represents its social context in terms of its ideals, [??? the expectation that contains it dialogue between the epitext helps to provides an image of the dialogue that ???]</p></li> | ||
+ | |||
+ | <li><p>The epitext and the text are in a relation, analogous to a dialogue, that mirrors the relation of the text itself to its casual, informal, or social context. In general, the analogy can be set up in either one of two ways, and can shift its sense from moment to moment:</p></li> | ||
+ | |||
+ | <ol style="list-style-type:lower-latin"> | ||
+ | |||
+ | <li><p>Epitext : Text :: Context : Text. Here, the epitext plays the part of common expectations, generic ideals, or social norms that are invoked in the process of communication.</p></li> | ||
+ | |||
+ | <li><p>Epitext : Text :: Text : Context. Here, the epitext gives vent to the individual conceits, idiosyncratic caprices, or whims of the moment that are stirred up by the process of communication.</p></li> | ||
+ | |||
+ | </ol></ol> | ||
+ | |||
+ | ====Example 3==== | ||
+ | |||
+ | The pragmatic idea about phenomena is that all phenomena are signs of significant objects, except for the ones that are not. In effect, all phenomena are meant to appear before the court of significance and are deemed by their very nature to be judged as signs of potential objects. Depending on how one chooses to say it, the results of this evaluation can be rendered in one of the following ways: | ||
+ | |||
+ | <ol style="list-style-type:decimal"> | ||
+ | |||
+ | <li><p>Some phenomena are in fact signs of significant objects. That is, they turn out to exist in a certain relation, one that is formally identical to a sign relation, wherein they denote objects that are important to the agent in question, an agent that thereby becomes the interpreter of these signs.</p></li> | ||
+ | |||
+ | <li><p>Some phenomena fail to be signs of significant objects, however much they initially appear to be. In this event, the failure can be accounted for in either one of two ways:</p></li> | ||
+ | |||
+ | <ol style="list-style-type:lower-latin"> | ||
+ | |||
+ | <li><p>Some phenomena can fail to be signs of any objects at all. This amounts to saying that what appears is not really a sign at all, not really a sign of any object at all.</p></li> | ||
+ | |||
+ | <li><p>All phenomena are signs in some sense, even if only granted a default, nominal, or token designation as signs, but some signs still fail to qualify as signs of significant objects, because the objects they signify are not important to the agents in question.</p></li> | ||
+ | |||
+ | </ol></ol> | ||
+ | |||
+ | ====Example 4==== | ||
+ | |||
+ | In the pragmatic theory of signs it is often said, “The question of the interpreter reduces to the question of the interpretant.” If this is true then it means that questions about the special interpreters that are designated to serve as the writer and the reader of a text are reducible to questions about the particular sign relations that independently and jointly define these two interpreters and their process of communication. The assumptions and the implications that are involved in this maxim are best explained by retracing the analysis that leads to this reduction, setting it out in the following stages: | ||
+ | |||
+ | <ol style="list-style-type:decimal"> | ||
+ | |||
+ | <li><p>By way of setting up the question of the interpreter, it needs to be noted that it can be asked in any one of several modalities. These are commonly referred to under a variety of different names, for instance:</p></li> | ||
+ | |||
+ | <ol style="list-style-type:lower-alpha"> | ||
+ | |||
+ | <li><p>What may be: the "prospective" or the "imaginative";<br> | ||
+ | also: the contingent, inquisitive, interrogative, optional, provisional, speculative, or "possible on some condition".</p></li> | ||
+ | |||
+ | <li><p>What is: the "descriptive" or the "indicative";<br> | ||
+ | also: the actual, apparent, definite, empirical, existential, experiential, factual, phenomenal, or "evident at some time".</p></li> | ||
+ | |||
+ | <li><p>What must be: the "prescriptive" or the "imperative";<br> | ||
+ | also: the injunctive, intentional, normative, obligatory, optative, prerequisite, or "necessary to some purpose".</p></li> | ||
+ | |||
+ | </ol></ol> | ||
+ | |||
+ | It is important to recognize that these lists refer to modes of judgment, not the results of the judgments themselves. Accordingly, they conflate under single headings the particular issues that remain to be sorted out through the performance of the appropriate judgments, for instance, the difference between an apparent fact and a genuine fact. In general, it is a difficult question what sorts of relationships exist among these modalities and what sorts of orderings are logically or naturally the best for organizing them in the mind. Here, they are given in one of the possible types of logical ordering, based on the idea that a thing must be possible before it can become actual, and that it must become actual (at some point in time) in order to qualify as being necessary. That is, being necessary implies being actual at some time or another, and being actual implies being possible in the first place. This amounts to thinking that something must be added to a condition of possibility in order to achieve a state of actuality, and that something must be added to a state of actuality in order to acquire a status of necessity. | ||
+ | |||
+ | All of this notwithstanding, it needs to be recognized that other types of logical arrangement can be motivated on other grounds. For example, there are good reasons to think that all of one's notions of possibility are in fact abstracted from one's actual experiences, making actuality prior in some empirically natural sense to the predicates of possibility. Since a plausible heuristic organization is all that is needed for now, this is one of those questions that can be left open until a later time. | ||
+ | |||
+ | <ol style="list-style-type:decimal" start="2"> | ||
+ | |||
+ | <li><p>Taking this setting as sufficiently well understood and keeping these modalities of inquiry in mind, the analysis proper can begin. Any question about the character of the interpreter that is acting in a situation can be identified with a question about the nature of the process of interpretation that is taking place under the corresponding conditions.</p></li> | ||
+ | |||
+ | <li><p>Any question about the nature of the process of interpretation that is taking place can be identified with a question about the properties of the interpretant that follows on a given sign. This is a question about the interpretant that is associated with a sign, in one of several modalities and as contingent on the total context.</p></li> | ||
+ | |||
+ | </ol> | ||
+ | |||
+ | ==Outline Formats== | ||
+ | |||
+ | <br> | ||
+ | |||
+ | {| align="center" cellpadding="8" width="90%" | ||
+ | | width="1%" | <big>•</big> | ||
+ | | colspan="3" | '''Example 1. Modus Ponens''' | ||
+ | |- | ||
+ | | | ||
+ | | width="1%" | | ||
+ | | colspan="2" | ''Information Reducing Inference'' | ||
+ | |- | ||
+ | | | ||
+ | | | ||
+ | | width="1%" | | ||
+ | | | ||
+ | <math>\begin{array}{l} | ||
+ | ~ p \Rightarrow q | ||
+ | \\ | ||
+ | ~ p | ||
+ | \\ | ||
+ | \overline{~~~~~~~~~~~~~~~} | ||
+ | \\ | ||
+ | ~ q | ||
+ | \end{array}</math> | ||
+ | |- | ||
+ | | | ||
+ | | | ||
+ | | colspan="2" | ''Information Preserving Inference'' | ||
+ | |- | ||
+ | | | ||
+ | | | ||
+ | | | ||
+ | | | ||
+ | <math>\begin{array}{l} | ||
+ | ~ p \Rightarrow q | ||
+ | \\ | ||
+ | ~ p | ||
+ | \\ | ||
+ | =\!=\!=\!=\!=\!=\!=\!= | ||
+ | \\ | ||
+ | ~ p ~ q | ||
+ | \end{array}</math> | ||
+ | |} | ||
+ | |||
+ | <br> | ||
+ | |||
+ | {| align="center" cellpadding="8" width="90%" | ||
+ | | width="1%" | <big>•</big> | ||
+ | | colspan="3" | '''Example 2. Transitivity''' | ||
+ | |- | ||
+ | | | ||
+ | | width="1%" | | ||
+ | | colspan="2" | ''Information Reducing Inference'' | ||
+ | |- | ||
+ | | | ||
+ | | | ||
+ | | width="1%" | | ||
+ | | | ||
+ | <math>\begin{array}{l} | ||
+ | ~ p \le q | ||
+ | \\ | ||
+ | ~ q \le r | ||
+ | \\ | ||
+ | \overline{~~~~~~~~~~~~~~~} | ||
+ | \\ | ||
+ | ~ p \le r | ||
+ | \end{array}</math> | ||
+ | |- | ||
+ | | | ||
+ | | | ||
+ | | colspan="2" | ''Information Preserving Inference'' | ||
+ | |- | ||
+ | | | ||
+ | | | ||
+ | | | ||
+ | | | ||
+ | <math>\begin{array}{l} | ||
+ | ~ p \le q | ||
+ | \\ | ||
+ | ~ q \le r | ||
+ | \\ | ||
+ | =\!=\!=\!=\!=\!=\!=\!= | ||
+ | \\ | ||
+ | ~ p \le q \le r | ||
+ | \end{array}</math> | ||
+ | |} | ||
+ | |||
+ | <br> | ||
+ | |||
+ | {| align="center" cellpadding="4" width="90%" | ||
+ | | <big>•</big> | ||
+ | | colspan="3" | '''Transitive Law''' (Implicational Inference) | ||
+ | |- | ||
+ | | width="1%" | | ||
+ | | width="1%" | | ||
+ | | colspan="2" | | ||
+ | <math>\begin{array}{l} | ||
+ | ~ p \le q | ||
+ | \\ | ||
+ | ~ q \le r | ||
+ | \\ | ||
+ | \overline{~~~~~~~~~~~~~~~} | ||
+ | \\ | ||
+ | ~ p \le r | ||
+ | \end{array}</math> | ||
+ | |- | ||
+ | | valign="top" | <big>•</big> | ||
+ | | colspan="3" | By itself, the information <math>p \le q</math> would reduce our uncertainty from <math>\log 8\!</math> bits to <math>\log 6\!</math> bits. | ||
+ | |- | ||
+ | | valign="top" | <big>•</big> | ||
+ | | colspan="3" | By itself, the information <math>q \le r</math> would reduce our uncertainty from <math>\log 8\!</math> bits to <math>\log 6\!</math> bits. | ||
+ | |- | ||
+ | | valign="top" | <big>•</big> | ||
+ | | colspan="3" | By itself, the information <math>p \le r</math> would reduce our uncertainty from <math>\log 8\!</math> bits to <math>\log 6\!</math> bits. | ||
+ | |} | ||
+ | |||
+ | <br> | ||
+ | |||
+ | {| align="center" cellpadding="4" width="90%" | ||
+ | | <big>•</big> | ||
+ | | colspan="3" | '''Transitive Law''' (Equational Inference) | ||
+ | |- | ||
+ | | width="1%" | | ||
+ | | width="1%" | | ||
+ | | colspan="2" | | ||
+ | <math>\begin{array}{l} | ||
+ | ~ p \le q | ||
+ | \\ | ||
+ | ~ q \le r | ||
+ | \\ | ||
+ | =\!=\!=\!=\!=\!=\!=\!= | ||
+ | \\ | ||
+ | ~ p \le q \le r | ||
+ | \end{array}</math> | ||
+ | |- | ||
+ | | valign="top" | <big>•</big> | ||
+ | | colspan="3" | The contents and the measures of information that are associated with the propositions <math>p \le q</math> and <math>q \le r</math> are the same as before. | ||
+ | |- | ||
+ | | valign="top" | <big>•</big> | ||
+ | | colspan="3" | On its own, the information <math>p \le q \le r</math> would reduce our uncertainty from log(8) = 3 bits to log(4) = 2 bits, a reduction of 1 bit. | ||
+ | |} | ||
+ | |||
+ | <br> | ||
==Mathematical Symbols== | ==Mathematical Symbols== | ||
− | {| cellpadding=" | + | {| cellpadding="8" |
+ | | <math>-<\!</math> || <code>-<</code> | ||
+ | |- | ||
+ | | <math>-\!<</math> || <code>-\!<</code> | ||
+ | |- | ||
+ | | <math>-\!\!<</math> || <code>-\!\!<</code> | ||
+ | |- | ||
+ | | <math>-\!\!\!<</math> || <code>-\!\!\!<</code> | ||
+ | |- | ||
| <math>\curlyvee</math> || <code>\curlyvee</code> | | <math>\curlyvee</math> || <code>\curlyvee</code> | ||
|- | |- | ||
Line 223: | Line 519: | ||
|- | |- | ||
| <math>\colon\!\gtrdot</math> || <code>\colon\!\gtrdot</code> | | <math>\colon\!\gtrdot</math> || <code>\colon\!\gtrdot</code> | ||
+ | |- | ||
+ | | <math>\And</math> || <code>\And</code> | ||
+ | |- | ||
+ | | <math>\dagger</math> || <code>\dagger</code> | ||
+ | |- | ||
+ | | <math>\ddagger</math> || <code>\ddagger</code> | ||
+ | |- | ||
+ | | <math>\lVert</math> || <code>\lVert</code> | ||
+ | |- | ||
+ | | <math>\rVert</math> || <code>\rVert</code> | ||
+ | |- | ||
+ | | <math>\parallel</math> || <code>\parallel</code> | ||
+ | |- | ||
+ | | <math>\P</math> || <code>\P</code> | ||
+ | |- | ||
+ | | <math>\S</math> || <code>\S</code> | ||
+ | |- | ||
+ | | <math>$</math> || <code>$</code> || NB. Idiosyntax of WikiTeX | ||
+ | |- | ||
+ | | <math>$\!</math> || <code>$\!</code> || NB. Idiosyntax of WikiTeX | ||
+ | |- | ||
+ | | <math>\$</math> || <code>\$</code> || NB. Standard Syntax in LaTeX | ||
+ | |- | ||
+ | |} | ||
+ | |||
+ | {| cellpadding="8" | ||
+ | | <math>\mathfrak{g}_{\dagger\ddagger} \, ^\dagger\mathit{l}_\parallel \, ^\parallel\mathrm{w} \, ^\ddagger\mathrm{h}</math> | ||
+ | |- | ||
+ | | <math>\mathfrak{g}_{\dagger\ddagger} {}^\dagger\mathit{l}_\parallel {}^\parallel\mathrm{w} {}^\ddagger\mathrm{h}</math> | ||
+ | |- | ||
+ | | <math>\mathfrak{g}_{\dagger\ddagger} {}^\dagger\!\mathit{l}_\parallel {}^\parallel\!\mathrm{w} {}^\ddagger\!\mathrm{h}</math> | ||
|} | |} | ||
==Cactus TeX== | ==Cactus TeX== | ||
+ | |||
+ | <br> | ||
+ | |||
+ | <math>\begin{array}{l} | ||
+ | \texttt{ } \\ | ||
+ | \texttt{~} \\ | ||
+ | \texttt{()} \\ | ||
+ | \texttt{(~)} \\ | ||
+ | \texttt{(( ))} \\ | ||
+ | \texttt{( )( )} \\ | ||
+ | \texttt{a b c} \\ | ||
+ | \texttt{a~b~c} \\ | ||
+ | \texttt{a(a)~=~(~)} \\ | ||
+ | \texttt{a((b)(c))~=~((ab)(ac))} \\ | ||
+ | \end{array}</math> | ||
+ | |||
+ | <br> | ||
+ | |||
+ | <math>\begin{array}{l} | ||
+ | \texttt{d}^2 \texttt{x} \\ | ||
+ | \texttt{d}^\text{2} \texttt{x} \\ | ||
+ | \texttt{d}^\texttt{2} \texttt{x} \\ | ||
+ | \end{array}</math> | ||
+ | |||
+ | <br> | ||
+ | |||
+ | {| align="center" cellpadding="8" width="90%" | ||
+ | | <math>\texttt{uv~(du~dv) ~+~ u(v)~(du (dv)) ~+~ (u)v~((du) dv) ~+~ (u)(v)~((du)(dv))}</math> | ||
+ | |} | ||
+ | |||
+ | <br> | ||
+ | |||
+ | {| align="center" cellpadding="8" width="90%" | ||
+ | | <math>\texttt{uv} \cdot \texttt{(du~dv)} + \texttt{u(v)} \cdot \texttt{(du (dv))} + \texttt{(u)v} \cdot \texttt{((du) dv)} + \texttt{(u)(v)} \cdot \texttt{((du)(dv))}</math> | ||
+ | |} | ||
+ | |||
+ | <br> | ||
<math>\begin{matrix} | <math>\begin{matrix} | ||
Line 293: | Line 657: | ||
<br> | <br> | ||
− | == | + | ==Examples of Logical Orbits== |
− | + | ===Version 1=== | |
− | + | {| align="center" cellpadding="8" style="text-align:center" | |
− | + | | | |
− | + | <math>\begin{array}{ccc} | |
− | + | \texttt{u}' & = & \texttt{((u)(v))} | |
− | + | \\ | |
− | + | \texttt{v}' & = & \texttt{((u,~v))} | |
− | + | \end{array}</math> | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | {| align="center" cellpadding=" | ||
− | |||
− | <math>\ | ||
− | |||
− | |||
|- | |- | ||
− | + | | | |
− | <math>\begin{ | + | <math>\begin{matrix} |
− | + | \text{Orbit 1} | |
− | |||
− | |||
− | |||
\\ | \\ | ||
− | + | \text{Initial Point :}~ (u, v) = (1, 1) | |
− | + | \end{matrix}</math> | |
− | + | |- | |
− | + | | | |
+ | <math>\begin{array}{c|cc} | ||
+ | t & u & v \\ | ||
\\ | \\ | ||
− | + | 0 & 1 & 1 \\ | |
− | & | + | 1 & 1 & 1 \\ |
− | & | + | 2 & '' & '' \\ |
− | + | \end{array}</math> | |
+ | |- | ||
+ | | | ||
+ | <math>\begin{matrix} | ||
+ | \text{Orbit 2} | ||
\\ | \\ | ||
− | + | \text{Initial Point :}~ (u, v) = (0, 0) | |
− | + | \end{matrix}</math> | |
− | + | |- | |
− | + | | | |
− | + | <math>\begin{array}{c|cc} | |
− | + | t & u & v \\ | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
\\ | \\ | ||
+ | 0 & 0 & 0 \\ | ||
+ | 1 & 0 & 1 \\ | ||
+ | 2 & 1 & 0 \\ | ||
+ | 3 & 1 & 0 \\ | ||
+ | 4 & '' & '' \\ | ||
\end{array}</math> | \end{array}</math> | ||
|} | |} | ||
− | + | ===Version 2=== | |
− | {| align="center" cellpadding=" | + | {| align="center" cellpadding="8" style="text-align:center" |
− | |||
− | |||
− | |||
− | |||
|- | |- | ||
− | | | + | | <math>\text{Orbit 1. Intitial Point :}~ (u, v) = (1, 1)</math> |
− | <math>\begin{array}{ | + | |- |
− | + | | | |
− | & | + | <math>\begin{array}{c|cc|cc|cc|cc|cc|c} |
− | & | + | t & u & v & du & dv & d^2 u & d^2 v & d^3 u & d^3 v & d^4 u & d^4 v & \ldots \\ |
− | & \ | ||
\\ | \\ | ||
− | + | 0 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\ | |
− | & | + | 1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\ |
− | & | + | 4 & '' & '' & '' & '' & '' & '' & '' & '' & '' & '' & \ldots \\ |
− | & | + | \end{array}</math> |
− | \\ | + | |- |
− | + | | <math>\text{Orbit 2. Intitial Point :}~ (u, v) = (0, 0)</math> | |
− | & | + | |- |
− | & | + | | |
− | & | + | <math>\begin{array}{c|cc|cc|cc|cc|cc|c} |
− | \\ | + | t & u & v & du & dv & d^2 u & d^2 v & d^3 u & d^3 v & d^4 u & d^4 v & \ldots \\ |
− | 4 | ||
− | & | ||
− | & | ||
− | & | ||
− | |||
− | |||
− | & | ||
− | & | ||
− | & | ||
− | |||
− | |||
− | & | ||
− | & | ||
− | & | ||
− | |||
− | |||
− | & | ||
− | & | ||
− | & | ||
\\ | \\ | ||
+ | 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 & 1 & 1 & 0 & \ldots \\ | ||
+ | 1 & 0 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & \ldots \\ | ||
+ | 2 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\ | ||
+ | 3 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\ | ||
+ | 4 & '' & '' & '' & '' & '' & '' & '' & '' & '' & '' & \ldots \\ | ||
\end{array}</math> | \end{array}</math> | ||
|} | |} | ||
− | + | ===Version 3=== | |
− | {| align="center" cellpadding=" | + | {| align="center" cellpadding="8" style="text-align:center" |
− | | | + | | <math>\text{Orbit 1}\!</math> |
− | <math> | ||
− | |||
− | |||
|- | |- | ||
− | + | | | |
− | <math>\begin{array}{ | + | <math>\begin{array}{c|cc|cc|} |
− | 1 | + | t & u & v & du & dv \\[8pt] |
− | & | + | 0 & 1 & 1 & 0 & 0 \\ |
− | + | 1 & '' & '' & '' & '' \\ | |
− | & | + | \end{array}</math> |
− | \\ | + | |- |
− | + | | | |
− | + | |- | |
− | + | | <math>\text{Orbit 2}\!</math> | |
− | & | + | |- |
− | \\ | + | | |
− | + | <math>\begin{array}{c|cc|cc|cc|} | |
− | & | + | t & u & v & du & dv & d^2 u & d^2 v \\[8pt] |
− | & | + | 0 & 0 & 0 & 0 & 1 & 1 & 0 \\ |
− | & | + | 1 & 0 & 1 & 1 & 1 & 1 & 1 \\ |
− | \\ | + | 2 & 1 & 0 & 0 & 0 & 0 & 0 \\ |
− | + | 3 & '' & '' & '' & '' & '' & '' \\ | |
− | & | + | \end{array}</math> |
− | & | + | |} |
− | & \ | + | |
− | \ | + | ==Type Markers== |
− | + | ||
− | + | ===Composer P=== | |
− | + | ||
− | + | {| align="center" cellpadding="8" width="90%" | |
− | + | | | |
− | + | <math>\begin{array}{l} | |
− | + | ((x \underset{A}{:} ~y \overset{B}{\underset{A}{:}}) \underset{B}{:} ~z \overset{C}{\underset{B}{:}}) \underset{C}{:} | |
− | + | \end{array}</math> | |
− | + | |} | |
− | \ | + | |
− | + | {| align="center" cellpadding="8" width="90%" | |
− | + | | | |
− | + | <math>\begin{array}{l} | |
− | + | ((x \overset{A}{:} ~y \overset{B}{\underset{A}{:}}) \overset{B}{:} ~z \overset{C}{\underset{B}{:}}) \overset{C}{:} | |
− | \ | + | \end{array}</math> |
− | 8 | + | |} |
− | + | ||
− | + | {| align="center" cellpadding="8" width="90%" | |
− | + | | | |
− | \\ | + | <math>\begin{array}{l} |
− | + | ((x \overset{A}{\Uparrow} ~y \overset{B}{\underset{A}{\Uparrow}}) \overset{B}{\Uparrow} ~z \overset{C}{\underset{B}{\Uparrow}}) \overset{C}{\Uparrow} | |
− | + | \end{array}</math> | |
− | + | |} | |
− | + | ||
− | \\ | + | {| align="center" cellpadding="8" width="90%" |
− | + | | | |
− | + | <math>\begin{array}{l} | |
− | + | ((x \underset{A}{\Downarrow} ~y \overset{A}{\underset{B}{\Downarrow}}) \underset{B}{\Downarrow} ~z \overset{B}{\underset{C}{\Downarrow}}) \underset{C}{\Downarrow} | |
− | + | \end{array}</math> | |
− | \\ | + | |} |
+ | |||
+ | {| align="center" cellpadding="8" width="90%" | ||
+ | | | ||
+ | <math>\begin{array}{l} | ||
+ | ((x \overset{ }{\underset{A}{\Downarrow}} ~ | ||
+ | y \overset{A}{\underset{B}{\Downarrow}} | ||
+ | ) \overset{ }{\underset{B}{\Downarrow}} ~ | ||
+ | z \overset{B}{\underset{C}{\Downarrow}} | ||
+ | ) \overset{ }{\underset{C}{\Downarrow}} | ||
+ | \\ \\ | ||
+ | = | ||
+ | \\ \\ | ||
+ | (x \overset{ }{\underset{A}{\Downarrow}} ~ | ||
+ | (y \overset{A}{\underset{B}{\Downarrow}} ~ | ||
+ | (z \overset{B}{\underset{C}{\Downarrow}} ~ | ||
+ | P \overset{B \Rightarrow C}{\underset{(A \Rightarrow B) \Rightarrow (A \Rightarrow C)}{\Downarrow}} | ||
+ | ) \overset{A \Rightarrow B}{\underset{A \Rightarrow C}{\Downarrow}} | ||
+ | ) \overset{A}{\underset{C}{\Downarrow}} | ||
+ | ) \overset{ }{\underset{C}{\Downarrow}} | ||
\end{array}</math> | \end{array}</math> | ||
|} | |} | ||
− | + | ===Transposer T=== | |
− | {| align="center" cellpadding=" | + | {| align="center" cellpadding="8" width="90%" |
− | + | | | |
− | <math>\ | + | <math>\begin{array}{l} |
− | + | (y \overset{ }{\underset{B}{\Downarrow}} ~ | |
− | + | (x \overset{ }{\underset{A}{\Downarrow}} ~ | |
− | + | z \overset{A}{\underset{B \Rightarrow C}{\Downarrow}} | |
− | + | ) \overset{B}{\underset{C}{\Downarrow}} | |
− | + | ) \overset{ }{\underset{C}{\Downarrow}} | |
− | + | \\ \\ | |
− | + | = | |
− | + | \\ \\ | |
− | + | (x \overset{ }{\underset{A}{\Downarrow}} ~ | |
− | \\ | + | (y \overset{ }{\underset{B}{\Downarrow}} ~ |
− | + | (z \overset{A}{\underset{B \Rightarrow C}{\Downarrow}} ~ | |
− | + | T \overset{A \Rightarrow (B \Rightarrow C)}{\underset{B \Rightarrow (A \Rightarrow C)}{\Downarrow}} | |
− | + | ) \overset{B}{\underset{A \Rightarrow C}{\Downarrow}} | |
− | + | ) \overset{A}{\underset{C}{\Downarrow}} | |
− | \\ | + | ) \overset{ }{\underset{C}{\Downarrow}} |
− | |||
− | |||
− | |||
− | |||
− | \\ | ||
− | |||
− | |||
− | |||
− | |||
− | \\ | ||
− | |||
− | |||
− | |||
− | |||
− | \\ | ||
− | |||
− | |||
− | |||
− | |||
− | \\ | ||
− | |||
− | |||
− | |||
− | |||
− | \ | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
\end{array}</math> | \end{array}</math> | ||
|} | |} | ||
− | + | ===Proof Example=== | |
− | {| align="center" cellpadding=" | + | {| align="center" cellpadding="8" width="90%" |
− | + | | | |
− | <math>\ | + | <math>\begin{array}{l} |
− | + | (y \overset{ }{\underset{B}{\Downarrow}} ~ | |
− | + | (x \overset{ }{\underset{A}{\Downarrow}} ~ | |
− | + | z \overset{A}{\underset{B \Rightarrow C}{\Downarrow}} | |
− | + | ) \overset{B}{\underset{C}{\Downarrow}} | |
− | + | ) \overset{ }{\underset{C}{\Downarrow}} | |
− | + | \\ \\ | |
− | + | = | |
− | + | \\ \\ | |
− | + | ((x \overset{ }{\underset{A}{\Downarrow}} ~ | |
− | \\ | + | (y \overset{ }{\underset{B}{\Downarrow}} ~ |
− | + | K \overset{B}{\underset{A \Rightarrow B}{\Downarrow}} | |
− | + | ) \overset{A}{\underset{B}{\Downarrow}} | |
− | + | ) \overset{ }{\underset{B}{\Downarrow}} ~ | |
− | + | (x \overset{ }{\underset{A}{\Downarrow}} ~ | |
− | \\ | + | z \overset{A}{\underset{B \Rightarrow C}{\Downarrow}} |
− | + | ) \overset{B}{\underset{C}{\Downarrow}} | |
− | + | ) \overset{ }{\underset{C}{\Downarrow}} | |
− | + | \\ \\ | |
− | + | = | |
− | \\ | + | \\ \\ |
− | + | (x \overset{ }{\underset{A}{\Downarrow}} ~ | |
− | + | ((y \overset{ }{\underset{B}{\Downarrow}} ~ | |
− | + | K \overset{B}{\underset{A \Rightarrow B}{\Downarrow}} | |
− | + | ) \overset{A}{\underset{B}{\Downarrow}} ~ | |
− | \\ | + | (z \overset{A}{\underset{B \Rightarrow C}{\Downarrow}} ~ |
− | + | S \overset{A \Rightarrow (B \Rightarrow C)}{\underset{(A \Rightarrow B) \Rightarrow (A \Rightarrow C)}{\Downarrow}} | |
− | + | ) \overset{A \Rightarrow B}{\underset{A \Rightarrow C}{\Downarrow}} | |
− | + | ) \overset{A}{\underset{C}{\Downarrow}} | |
− | + | ) \overset{ }{\underset{C}{\Downarrow}} | |
− | \\ | + | \\ \\ |
− | + | = | |
− | + | \\ \\ | |
− | + | \ldots | |
− | |||
− | \\ | ||
− | |||
− | |||
− | |||
− | |||
− | \\ | ||
− | |||
− | |||
− | |||
− | |||
− | \ | ||
− | |||
− | |||
− | |||
− | |||
− | \\ | ||
− | |||
− | |||
− | |||
− | |||
− | \\ | ||
− | |||
− | |||
− | |||
− | |||
− | \ | ||
\end{array}</math> | \end{array}</math> | ||
|} | |} | ||
− | < | + | ==Over And Under Setting== |
+ | |||
+ | <ol style="list-style-type:decimal"> | ||
+ | |||
+ | <li> | ||
+ | <p>The ''conjunction'' <math>\overset{J}{\underset{j}{\operatorname{Conj}}}\ q_j</math> of a set of propositions, <math>\{ q_j : j \in J \},</math> is a proposition that is true if and only if every one of the <math>q_j\!</math> is true.</p> | ||
+ | |||
+ | <p><math>\overset{J}{\underset{j}{\operatorname{Conj}}}\ q_j</math> is true <math>\Leftrightarrow</math> <math>q_j\!</math> is true for every <math>j \in J.</math></p></li> | ||
+ | |||
+ | <li> | ||
+ | <p>The ''surjunction'' <math>\overset{J}{\underset{j}{\operatorname{Surj}}}\ q_j</math> of a set of propositions, <math>\{ q_j : j \in J \},</math> is a proposition that is true if and only if exactly one of the <math>q_j\!</math> is untrue.</p> | ||
+ | |||
+ | <p><math>\overset{J}{\underset{j}{\operatorname{Surj}}}\ q_j</math> is true <math>\Leftrightarrow</math> <math>q_j\!</math> is untrue for unique <math>j \in J.</math></p></li> | ||
+ | |||
+ | </ol> | ||
+ | |||
+ | ==Equation Sequences== | ||
+ | |||
+ | {| align="center" cellpadding="8" width="90%" | ||
+ | | | ||
+ | <math>\begin{array}{lll} | ||
+ | [| \downharpoonleft s \downharpoonright |] | ||
+ | & = & [| F |] | ||
+ | \\[6pt] | ||
+ | & = & F^{-1} (\underline{1}) | ||
+ | \\[6pt] | ||
+ | & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ s ~\} | ||
+ | \\[6pt] | ||
+ | & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ F(x, y) = \underline{1} ~\} | ||
+ | \\[6pt] | ||
+ | & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ F(x, y) ~\} | ||
+ | \\[6pt] | ||
+ | & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ \underline{(}~x~,~y~\underline{)} = \underline{1} ~\} | ||
+ | \\[6pt] | ||
+ | & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ \underline{(}~x~,~y~\underline{)} ~\} | ||
+ | \\[6pt] | ||
+ | & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ x ~\operatorname{exclusive~or}~ y ~\} | ||
+ | \\[6pt] | ||
+ | & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ \operatorname{just~one~true~of}~ x, y ~\} | ||
+ | \\[6pt] | ||
+ | & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ x ~\operatorname{not~equal~to}~ y ~\} | ||
+ | \\[6pt] | ||
+ | & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ x \nLeftrightarrow y ~\} | ||
+ | \\[6pt] | ||
+ | & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ x \neq y ~\} | ||
+ | \\[6pt] | ||
+ | & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ x + y ~\}. | ||
+ | \end{array}</math> | ||
+ | |} | ||
− | {| align="center" cellpadding=" | + | {| align="center" cellpadding="8" width="90%" |
− | + | | | |
− | <math>\ | + | <math>\begin{array}{lll} |
− | | | + | [| F^\$ (p, q) |] |
− | + | & = & [| \underline{(}~p~,~q~\underline{)}^\$ |] | |
− | + | \\[6pt] | |
− | + | & = & (F^\$ (p, q))^{-1} (\underline{1}) | |
− | + | \\[6pt] | |
− | + | & = & \{~ x \in X ~:~ F^\$ (p, q)(x) ~\} | |
− | + | \\[6pt] | |
− | + | & = & \{~ x \in X ~:~ \underline{(}~p~,~q~\underline{)}^\$ (x) ~\} | |
− | + | \\[6pt] | |
− | + | & = & \{~ x \in X ~:~ \underline{(}~p(x)~,~q(x)~\underline{)} ~\} | |
− | + | \\[6pt] | |
− | + | & = & \{~ x \in X ~:~ p(x) + q(x) ~\} | |
− | + | \\[6pt] | |
− | + | & = & \{~ x \in X ~:~ p(x) \neq q(x) ~\} | |
− | \\ | + | \\[6pt] |
− | + | & = & \{~ x \in X ~:~ \upharpoonleft P \upharpoonright (x) ~\neq~ \upharpoonleft Q \upharpoonright (x) ~\} | |
− | + | \\[6pt] | |
− | + | & = & \{~ x \in X ~:~ x \in P ~\nLeftrightarrow~ x \in Q ~\} | |
− | + | \\[6pt] | |
− | \\ | + | & = & \{~ x \in X ~:~ x \in P\!-\!Q ~\operatorname{or}~ x \in Q\!-\!P ~\} |
− | + | \\[6pt] | |
− | & | + | & = & \{~ x \in X ~:~ x \in P\!-\!Q ~\cup~ Q\!-\!P ~\} |
− | & | + | \\[6pt] |
− | + | & = & \{~ x \in X ~:~ x \in P + Q ~\} | |
− | \\ | + | \\[6pt] |
− | + | & = & P + Q ~\subseteq~ X | |
− | + | \\[6pt] | |
− | + | & = & [|p|] + [|q|] ~\subseteq~ X | |
− | |||
− | \\ | ||
− | |||
− | & | ||
− | & | ||
− | |||
− | \\ | ||
− | |||
− | |||
− | |||
− | |||
− | \\ | ||
− | |||
− | & | ||
− | |||
− | & | ||
− | \\ | ||
− | |||
− | & | ||
− | & | ||
− | |||
− | \\ | ||
− | |||
− | & | ||
− | & | ||
− | |||
− | \\ | ||
− | |||
− | & | ||
− | & : | ||
− | |||
− | \\ | ||
− | |||
− | & | ||
− | |||
− | & | ||
− | \\ | ||
− | |||
− | |||
− | |||
− | |||
− | \\ | ||
− | |||
− | & | ||
− | |||
− | & | ||
− | \ | ||
\end{array}</math> | \end{array}</math> | ||
|} | |} | ||
+ | |||
+ | ==Multiline TeX Formats== | ||
<br> | <br> | ||
− | + | <math> | |
+ | \begin{cases} | ||
+ | a \\ | ||
+ | b \\ | ||
+ | c \\ | ||
+ | \begin{cases} | ||
+ | d \\ | ||
+ | e \\ | ||
+ | f \\ | ||
+ | \end{cases} \\ | ||
+ | g \\ | ||
+ | h \\ | ||
+ | i \\ | ||
+ | \end{cases} | ||
+ | </math> | ||
<br> | <br> | ||
− | + | <math>\begin{alignat}{2} | |
− | + | x & = (y - z)(y + z) \\ | |
− | + | & = y^2 - z^2 \\ | |
− | + | \end{alignat}</math> | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
<br> | <br> | ||
− | + | <math>\begin{align} | |
− | + | \operatorname{Der}^L | |
− | + | & = & \{ & (x, y) \in S \times I ~: \\ | |
− | + | & & & \begin{align} | |
− | + | \underset{o \in O}{\operatorname{Conj}} \\ | |
− | + | & \upharpoonleft \operatorname{Den}(L, x) \upharpoonright (o) & = \\ | |
− | + | & \upharpoonleft \operatorname{Den}(L, y) \upharpoonright (o) & \\ | |
− | + | \end{align} \\ | |
− | + | & & \} & \\ | |
− | + | \end{align}</math> | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
<br> | <br> | ||
− | + | <math>\begin{align} | |
− | + | \operatorname{Der}^L | |
− | + | & = & \{ & (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{align}</math> | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
<br> | <br> | ||
− | + | <math>\begin{align} | |
− | + | \operatorname{F2.2a.} \quad \operatorname{Der}^L | |
− | + | & = & \{ & (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{align}</math> | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
<br> | <br> | ||
− | + | <math>\begin{array}{lllll} | |
− | + | \operatorname{F2.2a.} & \operatorname{Der}^L & = & \{ & (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> | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
<br> | <br> |
Latest revision as of 01:36, 4 December 2011
Greek
ἐν ἀρχῇ
Ἐν ἀρχῇ ἦν ὁ λόγος
Πάτερ ἡμῶν ὁ ἐν τοῖς οὐρανοῖς· ἁγιασθήτω τὸ ὄνομά σου·
ἐλθέτω ἡ βασιλεία σου·
LOGOS
Epigraph Formats
'Tis a derivative from me to mine, | |
— Winter's Tale, 3.2.43–44 |
Out of the dimness opposite equals advance . . . . | |
— Walt Whitman, Leaves of Grass, [Whi, 28] |
On either side the river lie | ||
Long fields of barley and of rye, | ||
That clothe the wold and meet the sky; | ||
And thro' the field the road runs by | ||
To many-tower'd Camelot; | ||
And up and down the people go, | ||
Gazing where the lilies blow | ||
Round an island there below, | ||
The island of Shalott. | ||
— Tennyson, The Lady of Shalott, [Ten, 17] |
The most valuable insights are arrived at last; but the most valuable insights are methods. |
— Nietzsche, The Will to Power, [Nie, S469, 261] |
The power of form, the will to give form to oneself. "Happiness" admitted as a goal. Much strength and energy behind the emphasis on forms. The delight in looking at a life that seems so easy. — To the French, the Greeks looked like children. |
— Nietzsche, The Will to Power, [Nie, S94, 58] |
In every sort of project there are two things to consider: first, the absolute goodness of the project; in the second place, the facility of execution. In the first respect it suffices that the project be acceptable and practicable in itself, that what is good in it be in the nature of the thing; here, for example, that the proposed education be suitable for man and well adapted to the human heart. The second consideration depends on relations given in certain situations — relations accidental to the thing, which consequently are not necessary and admit of infinite variety. |
— Rousseau, Emile, or On Education, [Rou-1, 34–35] |
Division Styles
- Able
- Baker
- Charlie
- Able
- Baker
- Charlie
Blockquote Formats
Now, I ask, how is it that anything can be done with a symbol, without reflecting upon the conception, much less imagining the object that belongs to it? It is simply because the symbol has acquired a nature, which may be described thus, that when it is brought before the mind certain principles of its use — whether reflected on or not — by association immediately regulate the action of the mind; and these may be regarded as laws of the symbol itself which it cannot as a symbol transgress. (Peirce, CE 1, 173). |
The information of a term is the measure of its superfluous comprehension. That is to say that the proper office of the comprehension is to determine the extension of the term. … Every addition to the comprehension of a term, lessens its extension up to a certain point, after that further additions increase the information instead. … And therefore as every term must have information, every term has superfluous comprehension. And, hence, whenever we make a symbol to express any thing or any attribute we cannot make it so empty that it shall have no superfluous comprehension. I am going, next, to show that inference is symbolization and that the puzzle of the validity of scientific inference lies merely in this superfluous comprehension and is therefore entirely removed by a consideration of the laws of information. |
(Peirce, CE 1, 467). |
a. | The theories of the soul (psyche) handed down by our predecessors have been sufficiently discussed; now let us start afresh, as it were, and try to determine (diorisai) what the soul is, and what definition (logos) of it will be most comprehensive (koinotatos). |
b. | We describe one class of existing things as substance (ousia), and this we subdivide into three: (1) matter (hyle), which in itself is not an individual thing, (2) shape (morphe) or form (eidos), in virtue of which individuality is directly attributed, and (3) the compound of the two. |
c. | Matter is potentiality (dynamis), while form is realization or actuality (entelecheia), and the word actuality is used in two senses, illustrated by the possession of knowledge (episteme) and the exercise of it (theorein). |
d. | Bodies (somata) seem to be pre-eminently substances, and most particularly those which are of natural origin (physica), for these are the sources (archai) from which the rest are derived. |
e. | But of natural bodies some have life (zoe) and some have not; by life we mean the capacity for self-sustenance, growth, and decay. |
f. | Every natural body (soma physikon), then, which possesses life must be substance, and substance of the compound type (synthete). |
g. | But since it is a body of a definite kind, viz., having life, the body (soma) cannot be soul (psyche), for the body is not something predicated of a subject, but rather is itself to be regarded as a subject, i.e., as matter. |
h. | So the soul must be substance in the sense of being the form of a natural body, which potentially has life. And substance in this sense is actuality. |
i. | The soul, then, is the actuality of the kind of body we have described. But actuality has two senses, analogous to the possession of knowledge and the exercise of it. |
j. | Clearly (phaneron) actuality in our present sense is analogous to the possession of knowledge; for both sleep (hypnos) and waking (egregorsis) depend upon the presence of the soul, and waking is analogous to the exercise of knowledge, sleep to its possession (echein) but not its exercise (energein). |
k. | Now in one and the same person the possession of knowledge comes first. |
l. | The soul may therefore be defined as the first actuality of a natural body potentially possessing life; and such will be any body which possesses organs (organikon). |
m. | (The parts of plants are organs too, though very simple ones: e.g., the leaf protects the pericarp, and the pericarp protects the seed; the roots are analogous to the mouth, for both these absorb food.) |
n. | If then one is to find a definition which will apply to every soul, it will be "the first actuality of a natural body possessed of organs". |
o. | So one need no more ask (zetein) whether body and soul are one than whether the wax (keros) and the impression (schema) it receives are one, or in general whether the matter of each thing is the same as that of which it is the matter; for admitting that the terms unity and being are used in many senses, the paramount (kyrios) sense is that of actuality. |
p. | We have, then, given a general definition of what the soul is: it is substance in the sense of formula (logos), i.e., the essence of such-and-such a body. |
q. | Suppose that an implement (organon), e.g. an axe, were a natural body; the substance of the axe would be that which makes it an axe, and this would be its soul; suppose this removed, and it would no longer be an axe, except equivocally. As it is, it remains an axe, because it is not of this kind of body that the soul is the essence or formula, but only of a certain kind of natural body which has in itself a principle of movement and rest. |
r. | We must, however, investigate our definition in relation to the parts of the body. |
s. | If the eye were a living creature, its soul would be its vision; for this is the substance in the sense of formula of the eye. But the eye is the matter of vision, and if vision fails there is no eye, except in an equivocal sense, as for instance a stone or painted eye. |
t. | Now we must apply what we have found true of the part to the whole living body. For the same relation must hold good of the whole of sensation to the whole sentient body qua sentient as obtains between their respective parts. |
u. | That which has the capacity to live is not the body which has lost its soul, but that which possesses its soul; so seed and fruit are potentially bodies of this kind. |
v. | The waking state is actuality in the same sense as the cutting of the axe or the seeing of the eye, while the soul is actuality in the same sense as the faculty of the eye for seeing, or of the implement for doing its work. |
w. | The body is that which exists potentially; but just as the pupil and the faculty of seeing make an eye, so in the other case the soul and body make a living creature. |
x. | It is quite clear, then, that neither the soul nor certain parts of it, if it has parts, can be separated from the body; for in some cases the actuality belongs to the parts themselves. Not but what there is nothing to prevent some parts being separated, because they are not actualities of any body. |
y. | It is also uncertain (adelon) whether the soul as an actuality bears the same relation to the body as the sailor (ploter) to the ship (ploion). |
z. | This must suffice as an attempt to determine in rough outline the nature of the soul. |
(Aristotle, On the Soul, 2.1) |
Ordered List Formats
Simple
- Item 1
- Item a
- Item b
- Item c
- Item 2
- Item a
- Item b
- Item c
- Item 3
Complex
- Item 1
- Item a
- Item i
- Item ii
- Item iii
- Item b
- Item c
- Item 2
- Item a
- Item i
- Item ii
- Item iii
- Item b
- Item c
- Item 3
Examples
Example 1
In the present case, one can observe the possibility that the author is suggesting the following analogies:
One analogy says that authoring a text is like piloting a vehicle. This can be written in either one of two ways.
Poet / Poem = Pilot / Boat.
Poet / Pilot = Poem / Boat.
Pilot / Poet = Boat / Poem.
- …
Example 2
In this way, an epitext can serve a couple of functions within a text:
The epitext maintains an internal model of the informal context, the actual, intended, or likely "context of interpretation" (COI), or the typical "situation of communication" (SOC) that prevails in a given society of interpretive agents. It does this by preserving a constant but gentle reminder of the type of text that ultimately demands to be understood within this social context. In other words, it represents its social context in terms of its ideals, [??? the expectation that contains it dialogue between the epitext helps to provides an image of the dialogue that ???]
The epitext and the text are in a relation, analogous to a dialogue, that mirrors the relation of the text itself to its casual, informal, or social context. In general, the analogy can be set up in either one of two ways, and can shift its sense from moment to moment:
Epitext : Text :: Context : Text. Here, the epitext plays the part of common expectations, generic ideals, or social norms that are invoked in the process of communication.
Epitext : Text :: Text : Context. Here, the epitext gives vent to the individual conceits, idiosyncratic caprices, or whims of the moment that are stirred up by the process of communication.
Example 3
The pragmatic idea about phenomena is that all phenomena are signs of significant objects, except for the ones that are not. In effect, all phenomena are meant to appear before the court of significance and are deemed by their very nature to be judged as signs of potential objects. Depending on how one chooses to say it, the results of this evaluation can be rendered in one of the following ways:
Some phenomena are in fact signs of significant objects. That is, they turn out to exist in a certain relation, one that is formally identical to a sign relation, wherein they denote objects that are important to the agent in question, an agent that thereby becomes the interpreter of these signs.
Some phenomena fail to be signs of significant objects, however much they initially appear to be. In this event, the failure can be accounted for in either one of two ways:
Some phenomena can fail to be signs of any objects at all. This amounts to saying that what appears is not really a sign at all, not really a sign of any object at all.
All phenomena are signs in some sense, even if only granted a default, nominal, or token designation as signs, but some signs still fail to qualify as signs of significant objects, because the objects they signify are not important to the agents in question.
Example 4
In the pragmatic theory of signs it is often said, “The question of the interpreter reduces to the question of the interpretant.” If this is true then it means that questions about the special interpreters that are designated to serve as the writer and the reader of a text are reducible to questions about the particular sign relations that independently and jointly define these two interpreters and their process of communication. The assumptions and the implications that are involved in this maxim are best explained by retracing the analysis that leads to this reduction, setting it out in the following stages:
By way of setting up the question of the interpreter, it needs to be noted that it can be asked in any one of several modalities. These are commonly referred to under a variety of different names, for instance:
What may be: the "prospective" or the "imaginative";
also: the contingent, inquisitive, interrogative, optional, provisional, speculative, or "possible on some condition".What is: the "descriptive" or the "indicative";
also: the actual, apparent, definite, empirical, existential, experiential, factual, phenomenal, or "evident at some time".What must be: the "prescriptive" or the "imperative";
also: the injunctive, intentional, normative, obligatory, optative, prerequisite, or "necessary to some purpose".
It is important to recognize that these lists refer to modes of judgment, not the results of the judgments themselves. Accordingly, they conflate under single headings the particular issues that remain to be sorted out through the performance of the appropriate judgments, for instance, the difference between an apparent fact and a genuine fact. In general, it is a difficult question what sorts of relationships exist among these modalities and what sorts of orderings are logically or naturally the best for organizing them in the mind. Here, they are given in one of the possible types of logical ordering, based on the idea that a thing must be possible before it can become actual, and that it must become actual (at some point in time) in order to qualify as being necessary. That is, being necessary implies being actual at some time or another, and being actual implies being possible in the first place. This amounts to thinking that something must be added to a condition of possibility in order to achieve a state of actuality, and that something must be added to a state of actuality in order to acquire a status of necessity.
All of this notwithstanding, it needs to be recognized that other types of logical arrangement can be motivated on other grounds. For example, there are good reasons to think that all of one's notions of possibility are in fact abstracted from one's actual experiences, making actuality prior in some empirically natural sense to the predicates of possibility. Since a plausible heuristic organization is all that is needed for now, this is one of those questions that can be left open until a later time.
Taking this setting as sufficiently well understood and keeping these modalities of inquiry in mind, the analysis proper can begin. Any question about the character of the interpreter that is acting in a situation can be identified with a question about the nature of the process of interpretation that is taking place under the corresponding conditions.
Any question about the nature of the process of interpretation that is taking place can be identified with a question about the properties of the interpretant that follows on a given sign. This is a question about the interpretant that is associated with a sign, in one of several modalities and as contingent on the total context.
Outline Formats
• | Example 1. Modus Ponens | ||
Information Reducing Inference | |||
\(\begin{array}{l} ~ p \Rightarrow q \\ ~ p \\ \overline{~~~~~~~~~~~~~~~} \\ ~ q \end{array}\) | |||
Information Preserving Inference | |||
\(\begin{array}{l} ~ p \Rightarrow q \\ ~ p \\ ='"`UNIQ--h-13--QINU`"'\!=\!=\!=\!=\!=\!=\!= \\ ~ p ~ q \end{array}\) |
• | Example 2. Transitivity | ||
Information Reducing Inference | |||
\(\begin{array}{l} ~ p \le q \\ ~ q \le r \\ \overline{~~~~~~~~~~~~~~~} \\ ~ p \le r \end{array}\) | |||
Information Preserving Inference | |||
\(\begin{array}{l} ~ p \le q \\ ~ q \le r \\ ='"`UNIQ--h-14--QINU`"'\!=\!=\!=\!=\!=\!=\!= \\ ~ p \le q \le r \end{array}\) |
• | Transitive Law (Implicational Inference) | ||
\(\begin{array}{l} ~ p \le q \\ ~ q \le r \\ \overline{~~~~~~~~~~~~~~~} \\ ~ p \le r \end{array}\) | |||
• | By itself, the information \(p \le q\) would reduce our uncertainty from \(\log 8\!\) bits to \(\log 6\!\) bits. | ||
• | By itself, the information \(q \le r\) would reduce our uncertainty from \(\log 8\!\) bits to \(\log 6\!\) bits. | ||
• | By itself, the information \(p \le r\) would reduce our uncertainty from \(\log 8\!\) bits to \(\log 6\!\) bits. |
• | Transitive Law (Equational Inference) | ||
\(\begin{array}{l} ~ p \le q \\ ~ q \le r \\ ='"`UNIQ--h-15--QINU`"'\!=\!=\!=\!=\!=\!=\!= \\ ~ p \le q \le r \end{array}\) | |||
• | The contents and the measures of information that are associated with the propositions \(p \le q\) and \(q \le r\) are the same as before. | ||
• | On its own, the information \(p \le q \le r\) would reduce our uncertainty from log(8) = 3 bits to log(4) = 2 bits, a reduction of 1 bit. |
Mathematical Symbols
\(-<\!\) | -<
| |
\(-\!<\) | -\!<
| |
\(-\!\!<\) | -\!\!<
| |
\(-\!\!\!<\) | -\!\!\!<
| |
\(\curlyvee\) | \curlyvee
| |
\(\curlywedge\) | \curlywedge
| |
\(\lessdot\) | \lessdot
| |
\(\gtrdot\) | \gtrdot
| |
\(:\!\lessdot\) | :\!\lessdot
| |
\(:\!\gtrdot\) | :\!\gtrdot
| |
\(\colon\!\lessdot\) | \colon\!\lessdot
| |
\(\colon\!\gtrdot\) | \colon\!\gtrdot
| |
\(\And\) | \And
| |
\(\dagger\) | \dagger
| |
\(\ddagger\) | \ddagger
| |
\(\lVert\) | \lVert
| |
\(\rVert\) | \rVert
| |
\(\parallel\) | \parallel
| |
\(\P\) | \P
| |
\(\S\) | \S
| |
\($\) | $ |
NB. Idiosyntax of WikiTeX |
\($\!\) | $\! |
NB. Idiosyntax of WikiTeX |
\(\$\) | \$ |
NB. Standard Syntax in LaTeX |
\(\mathfrak{g}_{\dagger\ddagger} \, ^\dagger\mathit{l}_\parallel \, ^\parallel\mathrm{w} \, ^\ddagger\mathrm{h}\) |
\(\mathfrak{g}_{\dagger\ddagger} {}^\dagger\mathit{l}_\parallel {}^\parallel\mathrm{w} {}^\ddagger\mathrm{h}\) |
\(\mathfrak{g}_{\dagger\ddagger} {}^\dagger\!\mathit{l}_\parallel {}^\parallel\!\mathrm{w} {}^\ddagger\!\mathrm{h}\) |
Cactus TeX
\(\begin{array}{l} \texttt{ } \\ \texttt{~} \\ \texttt{()} \\ \texttt{(~)} \\ \texttt{(( ))} \\ \texttt{( )( )} \\ \texttt{a b c} \\ \texttt{a~b~c} \\ \texttt{a(a)~=~(~)} \\ \texttt{a((b)(c))~=~((ab)(ac))} \\ \end{array}\)
\(\begin{array}{l} \texttt{d}^2 \texttt{x} \\ \texttt{d}^\text{2} \texttt{x} \\ \texttt{d}^\texttt{2} \texttt{x} \\ \end{array}\)
\(\texttt{uv~(du~dv) ~+~ u(v)~(du (dv)) ~+~ (u)v~((du) dv) ~+~ (u)(v)~((du)(dv))}\) |
\(\texttt{uv} \cdot \texttt{(du~dv)} + \texttt{u(v)} \cdot \texttt{(du (dv))} + \texttt{(u)v} \cdot \texttt{((du) dv)} + \texttt{(u)(v)} \cdot \texttt{((du)(dv))}\) |
\(\begin{matrix} \bar{(} \ldots \bar{)} & \bar{|} \ldots \bar{|} \\ \\ \dot{(} \ldots \dot{)} & \dot{|} \ldots \dot{|} \\ \\ \hat{(} \ldots \hat{)} & \hat{|} \ldots \hat{|} \\ \\ \check{(} \ldots \check{)} & \check{|} \ldots \check{|} \\ \\ \tilde{(} \ldots \tilde{)} & \tilde{|} \ldots \tilde{|} \\ \\ \downharpoonleft \ldots \downharpoonright & \upharpoonleft \ldots \upharpoonright \\ \\ \overline{(} \ldots \overline{)} & \overline{|} \ldots \overline{|} \\ \\ \underline{(} \ldots \underline{)} & \underline{|} \ldots \underline{|} \\ \\ \overline{\underline{(}} \ldots \overline{\underline{)}} & \overline{\underline{|}} \ldots \overline{\underline{|}} \\ \\ \end{matrix}\)
\(\begin{array}{lllll} {}^{_\sim}\!X & = & U - X & = & \{ \, u \in U : \underline{(} u \in X \underline{)} \, \}. \end{array}\) |
\(\begin{array}{lllll} {}^{_\sim}\!X & = & U - X & = & \{ \, u \in U : \tilde{(} u \in X \tilde{)} \, \}. \end{array}\) |
- \[X = \{\ (\!|u|\!)(\!|v|\!),\ (\!|u|\!) v,\ u (\!|v|\!),\ u v\ \} \cong \mathbb{B}^2.\]
- \[X = \{\ \underline{(u)(v)},\ \underline{(u)~v},\ \underline{u~(v)},\ \underline{u~v}\ \} \cong \mathbb{B}^2.\]
- \[X = \{\!\]
(u)(v)
\(,\)(u)v
\(,\)u(v)
\(,\)uv
\(\} \cong \mathbb{B}^2.\)
- \[X = \{\!\]
(u)(v)
\(,\)(u)v
\(,\)u(v)
\(,\)uv
\(\} \cong \mathbb{B}^2.\)
- \(X = \{\!\)
(u)(v)
\(,\)(u)v
\(,\)u(v)
\(,\)uv
\(\} \cong \mathbb{B}^2.\)
- \(X = \{\!\)
- \(X = \{\!\)
(u)(v)
,(u)v
,u(v)
,uv
\(\} \cong \mathbb{B}^2.\)
- \(X = \{\!\)
Examples of Logical Orbits
Version 1
\(\begin{array}{ccc} \texttt{u}' & = & \texttt{((u)(v))} \\ \texttt{v}' & = & \texttt{((u,~v))} \end{array}\) |
\(\begin{matrix} \text{Orbit 1} \\ \text{Initial Point :}~ (u, v) = (1, 1) \end{matrix}\) |
\(\begin{array}{c|cc} t & u & v \\ \\ 0 & 1 & 1 \\ 1 & 1 & 1 \\ 2 & '' & '' \\ \end{array}\) |
\(\begin{matrix} \text{Orbit 2} \\ \text{Initial Point :}~ (u, v) = (0, 0) \end{matrix}\) |
\(\begin{array}{c|cc} t & u & v \\ \\ 0 & 0 & 0 \\ 1 & 0 & 1 \\ 2 & 1 & 0 \\ 3 & 1 & 0 \\ 4 & '' & '' \\ \end{array}\) |
Version 2
\(\text{Orbit 1. Intitial Point :}~ (u, v) = (1, 1)\) |
\(\begin{array}{c|cc|cc|cc|cc|cc|c} t & u & v & du & dv & d^2 u & d^2 v & d^3 u & d^3 v & d^4 u & d^4 v & \ldots \\ \\ 0 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\ 1 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\ 4 & '' & '' & '' & '' & '' & '' & '' & '' & '' & '' & \ldots \\ \end{array}\) |
\(\text{Orbit 2. Intitial Point :}~ (u, v) = (0, 0)\) |
\(\begin{array}{c|cc|cc|cc|cc|cc|c} t & u & v & du & dv & d^2 u & d^2 v & d^3 u & d^3 v & d^4 u & d^4 v & \ldots \\ \\ 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 & 1 & 1 & 0 & \ldots \\ 1 & 0 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & \ldots \\ 2 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\ 3 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & \ldots \\ 4 & '' & '' & '' & '' & '' & '' & '' & '' & '' & '' & \ldots \\ \end{array}\) |
Version 3
\(\text{Orbit 1}\!\) |
\(\begin{array}{c|cc|cc|} t & u & v & du & dv \\[8pt] 0 & 1 & 1 & 0 & 0 \\ 1 & '' & '' & '' & '' \\ \end{array}\) |
\(\text{Orbit 2}\!\) |
\(\begin{array}{c|cc|cc|cc|} t & u & v & du & dv & d^2 u & d^2 v \\[8pt] 0 & 0 & 0 & 0 & 1 & 1 & 0 \\ 1 & 0 & 1 & 1 & 1 & 1 & 1 \\ 2 & 1 & 0 & 0 & 0 & 0 & 0 \\ 3 & '' & '' & '' & '' & '' & '' \\ \end{array}\) |
Type Markers
Composer P
\(\begin{array}{l} ((x \underset{A}{:} ~y \overset{B}{\underset{A}{:}}) \underset{B}{:} ~z \overset{C}{\underset{B}{:}}) \underset{C}{:} \end{array}\) |
\(\begin{array}{l} ((x \overset{A}{:} ~y \overset{B}{\underset{A}{:}}) \overset{B}{:} ~z \overset{C}{\underset{B}{:}}) \overset{C}{:} \end{array}\) |
\(\begin{array}{l} ((x \overset{A}{\Uparrow} ~y \overset{B}{\underset{A}{\Uparrow}}) \overset{B}{\Uparrow} ~z \overset{C}{\underset{B}{\Uparrow}}) \overset{C}{\Uparrow} \end{array}\) |
\(\begin{array}{l} ((x \underset{A}{\Downarrow} ~y \overset{A}{\underset{B}{\Downarrow}}) \underset{B}{\Downarrow} ~z \overset{B}{\underset{C}{\Downarrow}}) \underset{C}{\Downarrow} \end{array}\) |
\(\begin{array}{l} ((x \overset{ }{\underset{A}{\Downarrow}} ~ y \overset{A}{\underset{B}{\Downarrow}} ) \overset{ }{\underset{B}{\Downarrow}} ~ z \overset{B}{\underset{C}{\Downarrow}} ) \overset{ }{\underset{C}{\Downarrow}} \\ \\ = \\ \\ (x \overset{ }{\underset{A}{\Downarrow}} ~ (y \overset{A}{\underset{B}{\Downarrow}} ~ (z \overset{B}{\underset{C}{\Downarrow}} ~ P \overset{B \Rightarrow C}{\underset{(A \Rightarrow B) \Rightarrow (A \Rightarrow C)}{\Downarrow}} ) \overset{A \Rightarrow B}{\underset{A \Rightarrow C}{\Downarrow}} ) \overset{A}{\underset{C}{\Downarrow}} ) \overset{ }{\underset{C}{\Downarrow}} \end{array}\) |
Transposer T
\(\begin{array}{l} (y \overset{ }{\underset{B}{\Downarrow}} ~ (x \overset{ }{\underset{A}{\Downarrow}} ~ z \overset{A}{\underset{B \Rightarrow C}{\Downarrow}} ) \overset{B}{\underset{C}{\Downarrow}} ) \overset{ }{\underset{C}{\Downarrow}} \\ \\ = \\ \\ (x \overset{ }{\underset{A}{\Downarrow}} ~ (y \overset{ }{\underset{B}{\Downarrow}} ~ (z \overset{A}{\underset{B \Rightarrow C}{\Downarrow}} ~ T \overset{A \Rightarrow (B \Rightarrow C)}{\underset{B \Rightarrow (A \Rightarrow C)}{\Downarrow}} ) \overset{B}{\underset{A \Rightarrow C}{\Downarrow}} ) \overset{A}{\underset{C}{\Downarrow}} ) \overset{ }{\underset{C}{\Downarrow}} \end{array}\) |
Proof Example
\(\begin{array}{l} (y \overset{ }{\underset{B}{\Downarrow}} ~ (x \overset{ }{\underset{A}{\Downarrow}} ~ z \overset{A}{\underset{B \Rightarrow C}{\Downarrow}} ) \overset{B}{\underset{C}{\Downarrow}} ) \overset{ }{\underset{C}{\Downarrow}} \\ \\ = \\ \\ ((x \overset{ }{\underset{A}{\Downarrow}} ~ (y \overset{ }{\underset{B}{\Downarrow}} ~ K \overset{B}{\underset{A \Rightarrow B}{\Downarrow}} ) \overset{A}{\underset{B}{\Downarrow}} ) \overset{ }{\underset{B}{\Downarrow}} ~ (x \overset{ }{\underset{A}{\Downarrow}} ~ z \overset{A}{\underset{B \Rightarrow C}{\Downarrow}} ) \overset{B}{\underset{C}{\Downarrow}} ) \overset{ }{\underset{C}{\Downarrow}} \\ \\ = \\ \\ (x \overset{ }{\underset{A}{\Downarrow}} ~ ((y \overset{ }{\underset{B}{\Downarrow}} ~ K \overset{B}{\underset{A \Rightarrow B}{\Downarrow}} ) \overset{A}{\underset{B}{\Downarrow}} ~ (z \overset{A}{\underset{B \Rightarrow C}{\Downarrow}} ~ S \overset{A \Rightarrow (B \Rightarrow C)}{\underset{(A \Rightarrow B) \Rightarrow (A \Rightarrow C)}{\Downarrow}} ) \overset{A \Rightarrow B}{\underset{A \Rightarrow C}{\Downarrow}} ) \overset{A}{\underset{C}{\Downarrow}} ) \overset{ }{\underset{C}{\Downarrow}} \\ \\ = \\ \\ \ldots \end{array}\) |
Over And Under Setting
-
The conjunction \(\overset{J}{\underset{j}{\operatorname{Conj}}}\ q_j\) of a set of propositions, \(\{ q_j : j \in J \},\) is a proposition that is true if and only if every one of the \(q_j\!\) is true.
\(\overset{J}{\underset{j}{\operatorname{Conj}}}\ q_j\) is true \(\Leftrightarrow\) \(q_j\!\) is true for every \(j \in J.\)
-
The surjunction \(\overset{J}{\underset{j}{\operatorname{Surj}}}\ q_j\) of a set of propositions, \(\{ q_j : j \in J \},\) is a proposition that is true if and only if exactly one of the \(q_j\!\) is untrue.
\(\overset{J}{\underset{j}{\operatorname{Surj}}}\ q_j\) is true \(\Leftrightarrow\) \(q_j\!\) is untrue for unique \(j \in J.\)
Equation Sequences
\(\begin{array}{lll} [| \downharpoonleft s \downharpoonright |] & = & [| F |] \\[6pt] & = & F^{-1} (\underline{1}) \\[6pt] & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ s ~\} \\[6pt] & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ F(x, y) = \underline{1} ~\} \\[6pt] & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ F(x, y) ~\} \\[6pt] & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ \underline{(}~x~,~y~\underline{)} = \underline{1} ~\} \\[6pt] & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ \underline{(}~x~,~y~\underline{)} ~\} \\[6pt] & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ x ~\operatorname{exclusive~or}~ y ~\} \\[6pt] & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ \operatorname{just~one~true~of}~ x, y ~\} \\[6pt] & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ x ~\operatorname{not~equal~to}~ y ~\} \\[6pt] & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ x \nLeftrightarrow y ~\} \\[6pt] & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ x \neq y ~\} \\[6pt] & = & \{~ (x, y) \in \underline\mathbb{B}^2 ~:~ x + y ~\}. \end{array}\) |
\(\begin{array}{lll} [| F^\$ (p, q) |] & = & [| \underline{(}~p~,~q~\underline{)}^\$ |] \\[6pt] & = & (F^\$ (p, q))^{-1} (\underline{1}) \\[6pt] & = & \{~ x \in X ~:~ F^\$ (p, q)(x) ~\} \\[6pt] & = & \{~ x \in X ~:~ \underline{(}~p~,~q~\underline{)}^\$ (x) ~\} \\[6pt] & = & \{~ x \in X ~:~ \underline{(}~p(x)~,~q(x)~\underline{)} ~\} \\[6pt] & = & \{~ x \in X ~:~ p(x) + q(x) ~\} \\[6pt] & = & \{~ x \in X ~:~ p(x) \neq q(x) ~\} \\[6pt] & = & \{~ x \in X ~:~ \upharpoonleft P \upharpoonright (x) ~\neq~ \upharpoonleft Q \upharpoonright (x) ~\} \\[6pt] & = & \{~ x \in X ~:~ x \in P ~\nLeftrightarrow~ x \in Q ~\} \\[6pt] & = & \{~ x \in X ~:~ x \in P\!-\!Q ~\operatorname{or}~ x \in Q\!-\!P ~\} \\[6pt] & = & \{~ x \in X ~:~ x \in P\!-\!Q ~\cup~ Q\!-\!P ~\} \\[6pt] & = & \{~ x \in X ~:~ x \in P + Q ~\} \\[6pt] & = & P + Q ~\subseteq~ X \\[6pt] & = & [|p|] + [|q|] ~\subseteq~ X \end{array}\) |
Multiline TeX Formats
\( \begin{cases} a \\ b \\ c \\ \begin{cases} d \\ e \\ f \\ \end{cases} \\ g \\ h \\ i \\ \end{cases} \)
\(\begin{alignat}{2} x & = (y - z)(y + z) \\ & = y^2 - z^2 \\ \end{alignat}\)
\(\begin{align} \operatorname{Der}^L & = & \{ & (x, y) \in S \times I ~: \\ & & & \begin{align} \underset{o \in O}{\operatorname{Conj}} \\ & \upharpoonleft \operatorname{Den}(L, x) \upharpoonright (o) & = \\ & \upharpoonleft \operatorname{Den}(L, y) \upharpoonright (o) & \\ \end{align} \\ & & \} & \\ \end{align}\)
\(\begin{align} \operatorname{Der}^L & = & \{ & (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{align}\)
\(\begin{align} \operatorname{F2.2a.} \quad \operatorname{Der}^L & = & \{ & (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{align}\)
\(\begin{array}{lllll} \operatorname{F2.2a.} & \operatorname{Der}^L & = & \{ & (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}\)