MyWikiBiz

Changes

User:Jon Awbrey/SCRATCHPAD (view source)

Revision as of 01:36, 4 December 2011

22,195 bytes added ,  01:36, 4 December 2011
→‎Examples
Line 16: Line 16:     
==Epigraph Formats==
 
==Epigraph Formats==
 +
 +
<br>
 +
 +
{| cellpadding="2" cellspacing="2" width="100%"
 +
| width="60%" | &nbsp;
 +
| width="40%" |
 +
'Tis a derivative from me to mine,<br>
 +
And only that I stand for.
 +
|-
 +
| height="50px" | &nbsp;
 +
| valign="top"  | &mdash; ''Winter's Tale'', 3.2.43&ndash;44
 +
|}
    
<br>
 
<br>
Line 89: Line 101:  
| align="right" | &mdash; Rousseau, ''Emile, or On Education'', [Rou-1, 34&ndash;35]
 
| align="right" | &mdash; Rousseau, ''Emile, or On Education'', [Rou-1, 34&ndash;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="0" cellspacing="0" width="90%"
+
{| 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 &mdash; whether reflected on or not &mdash; 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 &mdash; whether reflected on or not &mdash; 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 177: Line 209:  
<br>
 
<br>
   −
==Outline Form==
+
==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 192: Line 244:  
     </ol>
 
     </ol>
 
   <li>Item 2</li>
 
   <li>Item 2</li>
 +
    <ol style="list-style-type:lower-latin">
 +
      <li>Item a</li>
 +
        <ol style="list-style-type:lower-roman">
 +
          <li>Item i</li>
 +
          <li>Item ii</li>
 +
          <li>Item iii</li>
 +
        </ol>
 +
      <li>Item b</li>
 +
      <li>Item c</li>
 +
    </ol>
 
   <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>&hellip;</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, &ldquo;The question of the interpreter reduces to the question of the interpretant.&rdquo;  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>&bull;</big>
 +
| colspan="3" | '''Example 1.  Modus Ponens'''
 +
|-
 +
| &nbsp;
 +
| width="1%" | &nbsp;
 +
| colspan="2" | ''Information Reducing Inference''
 +
|-
 +
| &nbsp;
 +
| &nbsp;
 +
| width="1%" | &nbsp;
 +
|
 +
<math>\begin{array}{l}
 +
~ p \Rightarrow q
 +
\\
 +
~ p
 +
\\
 +
\overline{~~~~~~~~~~~~~~~}
 +
\\
 +
~ q
 +
\end{array}</math>
 +
|-
 +
| &nbsp;
 +
| &nbsp;
 +
| colspan="2" | ''Information Preserving Inference''
 +
|-
 +
| &nbsp;
 +
| &nbsp;
 +
| &nbsp;
 +
|
 +
<math>\begin{array}{l}
 +
~ p \Rightarrow q
 +
\\
 +
~ p
 +
\\
 +
=\!=\!=\!=\!=\!=\!=\!=
 +
\\
 +
~ p ~ q
 +
\end{array}</math>
 +
|}
 +
 +
<br>
 +
 +
{| align="center" cellpadding="8" width="90%"
 +
| width="1%" | <big>&bull;</big>
 +
| colspan="3" | '''Example 2.  Transitivity'''
 +
|-
 +
| &nbsp;
 +
| width="1%" | &nbsp;
 +
| colspan="2" | ''Information Reducing Inference''
 +
|-
 +
| &nbsp;
 +
| &nbsp;
 +
| width="1%" | &nbsp;
 +
|
 +
<math>\begin{array}{l}
 +
~ p \le q
 +
\\
 +
~ q \le r
 +
\\
 +
\overline{~~~~~~~~~~~~~~~}
 +
\\
 +
~ p \le r
 +
\end{array}</math>
 +
|-
 +
| &nbsp;
 +
| &nbsp;
 +
| colspan="2" | ''Information Preserving Inference''
 +
|-
 +
| &nbsp;
 +
| &nbsp;
 +
| &nbsp;
 +
|
 +
<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>&bull;</big>
 +
| colspan="3" | '''Transitive Law''' (Implicational Inference)
 +
|-
 +
| width="1%" | &nbsp;
 +
| width="1%" | &nbsp;
 +
| colspan="2" |
 +
<math>\begin{array}{l}
 +
~ p \le q
 +
\\
 +
~ q \le r
 +
\\
 +
\overline{~~~~~~~~~~~~~~~}
 +
\\
 +
~ p \le r
 +
\end{array}</math>
 +
|-
 +
| valign="top" | <big>&bull;</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>&bull;</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>&bull;</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>&bull;</big>
 +
| colspan="3" | '''Transitive Law''' (Equational Inference)
 +
|-
 +
| width="1%" | &nbsp;
 +
| width="1%" | &nbsp;
 +
| colspan="2" |
 +
<math>\begin{array}{l}
 +
~ p \le q
 +
\\
 +
~ q \le r
 +
\\
 +
=\!=\!=\!=\!=\!=\!=\!=
 +
\\
 +
~ p \le q \le r
 +
\end{array}</math>
 +
|-
 +
| valign="top" | <big>&bull;</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>&bull;</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="4"
+
{| 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>\curlywedge</math> || <code>\curlywedge</code>
 +
|-
 
| <math>\lessdot</math> || <code>\lessdot</code>
 
| <math>\lessdot</math> || <code>\lessdot</code>
 
|-
 
|-
Line 209: 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==
   −
:: <math>X = \{\ (\!|u|\!)(\!|v|\!),\ (\!|u|\!) v,\ u (\!|v|\!),\ u v\ \} \cong \mathbb{B}^2.</math>
+
<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>
   −
:: <math>X = \{\ \underline{(u)(v)},\ \underline{(u)~v},\ \underline{u~(v)},\ \underline{u~v}\ \} \cong \mathbb{B}^2.</math>
+
<br>
   −
:: <math>X = \{\!</math> '''<code>(u)(v)</code>'''<math>,</math> '''<code>(u)v</code>'''<math>,</math> '''<code>u(v)</code>'''<math>,</math> '''<code>uv</code>''' <math>\} \cong \mathbb{B}^2.</math>
+
<math>\begin{array}{l}
 +
\texttt{d}^2 \texttt{x}          \\
 +
\texttt{d}^\text{2} \texttt{x}   \\
 +
\texttt{d}^\texttt{2} \texttt{x}  \\
 +
\end{array}</math>
   −
:: <math>X = \{\!</math> '''<code>(u)(v)</code>''' <math>,</math> '''<code>(u)v</code>''' <math>,</math> '''<code>u(v)</code>''' <math>,</math> '''<code>uv</code>''' <math>\} \cong \mathbb{B}^2.</math>
+
<br>
   −
:: '''<math>X = \{\!</math> <code>(u)(v)</code> <math>,</math> <code>(u)v</code> <math>,</math> <code>u(v)</code> <math>,</math> <code>uv</code> <math>\} \cong \mathbb{B}^2.</math>'''
+
{| align="center" cellpadding="8" width="90%"
 +
| <math>\texttt{uv~(du~dv) ~+~ u(v)~(du (dv)) ~+~ (u)v~((du) dv) ~+~ (u)(v)~((du)(dv))}</math>
 +
|}
   −
:: '''<math>X = \{\!</math>&nbsp;<code>(u)(v)</code>&nbsp;,&nbsp;<code>(u)v</code>&nbsp;,&nbsp; <code>u(v)</code>&nbsp;,&nbsp;<code>uv</code>&nbsp;<math>\} \cong \mathbb{B}^2.</math>'''
+
<br>
   −
==Box Displays==
+
{| 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>
 
<br>
   −
{| align="center" cellpadding="12" cellspacing="0" style="border-top:1px solid black" width="90%"
+
<math>\begin{matrix}
−
| align="left"  style="border-left:1px solid black;"  width="50%" |
+
\bar{(} \ldots \bar{)} &
−
<math>\mathfrak{C} (\mathfrak{P}) : \text{Grammar 1}\!</math>
+
\bar{|} \ldots \bar{|} \\
−
| align="right" style="border-right:1px solid black;" width="50%" |
+
\\
−
<math>\mathfrak{Q} = \emptyset</math>
+
\dot{(} \ldots \dot{)} &
−
|-
+
\dot{|} \ldots \dot{|} \\
−
| colspan="2" style="border-top:1px solid black; border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black" |
+
\\
−
<math>\begin{array}{rcll}
+
\hat{(} \ldots \hat{)} &
−
1.
+
\hat{|} \ldots \hat{|} \\
−
& S
+
\\
−
& :>
+
\check{(} \ldots \check{)} &
−
& m_1 \ = \ ^{\backprime\backprime} \operatorname{~} ^{\prime\prime}
+
\check{|} \ldots \check{|} \\
 
\\
 
\\
−
2.
+
\tilde{(} \ldots \tilde{)} &
−
& S
+
\tilde{|} \ldots \tilde{|} \\
−
& :>
  −
& p_j, \, \text{for each} \, j \in J
   
\\
 
\\
−
3.
+
\downharpoonleft \ldots \downharpoonright &
−
& S
+
\upharpoonleft \ldots \upharpoonright    \\
−
& :>
  −
& \operatorname{Conc}^0 \ = \ ^{\backprime\backprime\prime\prime}
   
\\
 
\\
−
4.
+
\overline{(} \ldots \overline{)} &
−
& S
+
\overline{|} \ldots \overline{|} \\
−
& :>
  −
& \operatorname{Surc}^0 \ = \ ^{\backprime\backprime} \, \operatorname{()} \, ^{\prime\prime}
   
\\
 
\\
−
5.
+
\underline{(} \ldots \underline{)} &
−
& S
+
\underline{|} \ldots \underline{|} \\
−
& :>
  −
& S^*
   
\\
 
\\
−
6.
+
\overline{\underline{(}} \ldots \overline{\underline{)}} &
−
& S
+
\overline{\underline{|}} \ldots \overline{\underline{|}} \\
−
& :>
  −
& ^{\backprime\backprime} \, \operatorname{(} \, ^{\prime\prime} \, \cdot \, S \, \cdot \, ( \, ^{\backprime\backprime} \operatorname{,} ^{\prime\prime} \, \cdot \, S \, )^* \, \cdot \, ^{\backprime\backprime} \, \operatorname{)} \, ^{\prime\prime}
   
\\
 
\\
 +
\end{matrix}</math>
 +
 +
{| align="center" cellpadding="8" width="90%"
 +
|
 +
<math>\begin{array}{lllll}
 +
{}^{_\sim}\!X
 +
& = &
 +
U - X
 +
& = &
 +
\{ \, u \in U : \underline{(} u \in X \underline{)} \, \}.
 +
\end{array}</math>
 +
|}
 +
 +
{| align="center" cellpadding="8" width="90%"
 +
|
 +
<math>\begin{array}{lllll}
 +
{}^{_\sim}\!X
 +
& = &
 +
U - X
 +
& = &
 +
\{ \, u \in U : \tilde{(} u \in X \tilde{)} \, \}.
 
\end{array}</math>
 
\end{array}</math>
 
|}
 
|}
 +
 +
:: <math>X = \{\ (\!|u|\!)(\!|v|\!),\ (\!|u|\!) v,\ u (\!|v|\!),\ u v\ \} \cong \mathbb{B}^2.</math>
 +
 +
:: <math>X = \{\ \underline{(u)(v)},\ \underline{(u)~v},\ \underline{u~(v)},\ \underline{u~v}\ \} \cong \mathbb{B}^2.</math>
 +
 +
:: <math>X = \{\!</math> '''<code>(u)(v)</code>'''<math>,</math> '''<code>(u)v</code>'''<math>,</math> '''<code>u(v)</code>'''<math>,</math> '''<code>uv</code>''' <math>\} \cong \mathbb{B}^2.</math>
 +
 +
:: <math>X = \{\!</math> '''<code>(u)(v)</code>''' <math>,</math> '''<code>(u)v</code>''' <math>,</math> '''<code>u(v)</code>''' <math>,</math> '''<code>uv</code>''' <math>\} \cong \mathbb{B}^2.</math>
 +
 +
:: '''<math>X = \{\!</math> <code>(u)(v)</code> <math>,</math> <code>(u)v</code> <math>,</math> <code>u(v)</code> <math>,</math> <code>uv</code> <math>\} \cong \mathbb{B}^2.</math>'''
 +
 +
:: '''<math>X = \{\!</math>&nbsp;<code>(u)(v)</code>&nbsp;,&nbsp;<code>(u)v</code>&nbsp;,&nbsp; <code>u(v)</code>&nbsp;,&nbsp;<code>uv</code>&nbsp;<math>\} \cong \mathbb{B}^2.</math>'''
    
<br>
 
<br>
   −
{| align="center" cellpadding="12" cellspacing="0" style="border-top:1px solid black" width="90%"
+
==Examples of Logical Orbits==
−
| align="left"  style="border-left:1px solid black;"  width="50%" |
+
 
−
<math>\mathfrak{C} (\mathfrak{P}) : \text{Grammar 2}\!</math>
+
===Version 1===
−
| align="right" style="border-right:1px solid black;" width="50%" |
+
 
−
<math>\mathfrak{Q} = \{ \, ^{\backprime\backprime} T ^{\prime\prime} \, \}</math>
+
{| 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>
 
|-
 
|-
−
| colspan="2" style="border-top:1px solid black; border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black" |
+
|
−
<math>\begin{array}{rcll}
+
<math>\begin{matrix}
−
1.
+
\text{Orbit 1}
−
& S
  −
& :>
  −
& \varepsilon
   
\\
 
\\
−
2.
+
\text{Initial Point :}~ (u, v) = (1, 1)
−
& S
+
\end{matrix}</math>
−
& :>
+
|-
−
& m_1
+
|
 +
<math>\begin{array}{c|cc}
 +
t &  u & v \\
 
\\
 
\\
−
3.
+
0 &  1 &  1 \\
−
& S
+
1 & 1 &  1 \\
−
& :>
+
2 & '' & '' \\
−
& p_j, \, \text{for each} \, j \in J
+
\end{array}</math>
 +
|-
 +
|
 +
<math>\begin{matrix}
 +
\text{Orbit 2}
 
\\
 
\\
−
4.
+
\text{Initial Point :}~ (u, v) = (0, 0)
−
& S
+
\end{matrix}</math>
−
& :>
+
|-
−
& S \, \cdot \, S
+
|
 +
<math>\begin{array}{c|cc}
 +
t &  u & v \\
 
\\
 
\\
−
5.
+
0 &  0 &  0 \\
−
& S
+
1 & 0 &  1 \\
−
& :>
+
2 & 1 &  0 \\
−
& ^{\backprime\backprime} \, \operatorname{(} \, ^{\prime\prime} \, \cdot \, T \, \cdot \, ^{\backprime\backprime} \, \operatorname{)} \, ^{\prime\prime}
+
3 &  1 & 0 \\
 +
4 & '' & '' \\
 +
\end{array}</math>
 +
|}
 +
 
 +
===Version 2===
 +
 
 +
{| align="center" cellpadding="8" style="text-align:center"
 +
|-
 +
| <math>\text{Orbit 1. Intitial Point :}~ (u, v) = (1, 1)</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 \\
 
\\
 
\\
−
6.
+
0 &  1 &  1 &  0 &  0 &    0 &    0 &    0 &    0 &    0 &    0 & \ldots \\
−
& T
+
1 &  1 &  1 &  0 &  0 &    0 &    0 &    0 &    0 &     0 &     0 & \ldots \\
−
& :>
+
4 & '' & '' & '' & '' &    '' &    '' &    '' &    '' &   '' &   '' & \ldots \\
−
& S
+
\end{array}</math>
−
\\
+
|-
−
7.
+
| <math>\text{Orbit 2. Intitial Point :}~ (u, v) = (0, 0)</math>
−
& T
+
|-
−
& :>
+
|
−
& T \, \cdot \, ^{\backprime\backprime} \operatorname{,} ^{\prime\prime} \, \cdot \, S
+
<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 &  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>
 
|}
 
|}
   −
<br>
+
===Version 3===
   −
{| align="center" cellpadding="12" cellspacing="0" style="border-top:1px solid black" width="90%"
+
{| align="center" cellpadding="8" style="text-align:center"
−
| align="left"  style="border-left:1px solid black;"  width="50%" |
+
| <math>\text{Orbit 1}\!</math>
−
<math>\mathfrak{C} (\mathfrak{P}) : \text{Grammar 3}\!</math>
  −
| align="right" style="border-right:1px solid black;" width="50%" |
  −
<math>\mathfrak{Q} = \{ \, ^{\backprime\backprime} F ^{\prime\prime}, \, ^{\backprime\backprime} R ^{\prime\prime}, \, ^{\backprime\backprime} T ^{\prime\prime} \, \}</math>
   
|-
 
|-
−
| colspan="2" style="border-top:1px solid black; border-bottom:1px solid black; border-left:1px solid black; border-right:1px solid black" |
+
|
−
<math>\begin{array}{rcll}
+
<math>\begin{array}{c|cc|cc|}
−
1.
+
t &  u &  v & du & dv \\[8pt]
−
& S
+
0 &  1 &  1 &  0 &  0 \\
−
& :>
+
1 & '' & '' & '' & '' \\
−
& R
+
\end{array}</math>
−
\\
+
|-
−
2.
+
| &nbsp;
−
& S
+
|-
−
& :>
+
| <math>\text{Orbit 2}\!</math>
−
& F
+
|-
−
\\
+
|
−
3.
+
<math>\begin{array}{c|cc|cc|cc|}
−
& S
+
t &  u &  v & du & dv & d^2 u & d^2 v \\[8pt]
−
& :>
+
0 &  0 &  0 &  0 &  1 &    1 &    0 \\
−
& S \, \cdot \, S
+
1 &  0 &  1 &  1 &  1 &    1 &    1 \\
−
\\
+
2 &  1 &  0 &  0 &  0 &    0 &    0 \\
−
4.
+
3 & '' & '' & '' & '' &    '' &    '' \\
−
& R
+
\end{array}</math>
−
& :>
+
|}
−
& \varepsilon
+
 
−
\\
+
==Type Markers==
−
5.
+
 
−
& R
+
===Composer P===
−
& :>
+
 
−
& m_1
+
{| align="center" cellpadding="8" width="90%"
−
\\
+
|
−
6.
+
<math>\begin{array}{l}
−
& R
+
((x \underset{A}{:} ~y \overset{B}{\underset{A}{:}}) \underset{B}{:} ~z \overset{C}{\underset{B}{:}}) \underset{C}{:}
−
& :>
+
\end{array}</math>
−
& p_j, \, \text{for each} \, j \in J
+
|}
−
\\
+
 
−
7.
+
{| align="center" cellpadding="8" width="90%"
−
& R
+
|
−
& :>
+
<math>\begin{array}{l}
−
& R \, \cdot \, R
+
((x \overset{A}{:} ~y \overset{B}{\underset{A}{:}}) \overset{B}{:} ~z \overset{C}{\underset{B}{:}}) \overset{C}{:}
−
\\
+
\end{array}</math>
−
8.
+
|}
−
& F
+
 
−
& :>
+
{| align="center" cellpadding="8" width="90%"
−
& ^{\backprime\backprime} \, \operatorname{(} \, ^{\prime\prime} \, \cdot \, T \, \cdot \, ^{\backprime\backprime} \, \operatorname{)} \, ^{\prime\prime}
+
|
−
\\
+
<math>\begin{array}{l}
−
9.
+
((x \overset{A}{\Uparrow} ~y \overset{B}{\underset{A}{\Uparrow}}) \overset{B}{\Uparrow} ~z \overset{C}{\underset{B}{\Uparrow}}) \overset{C}{\Uparrow}
−
& T
+
\end{array}</math>
−
& :>
+
|}
−
& S
+
 
−
\\
+
{| align="center" cellpadding="8" width="90%"
−
10.
+
|
−
& T
+
<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}
−
& T \, \cdot \, ^{\backprime\backprime} \operatorname{,} ^{\prime\prime} \, \cdot \, S
+
\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>
 +
|}
 +
 
 +
===Transposer T===
 +
 
 +
{| align="center" cellpadding="8" width="90%"
 +
|
 +
<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>
 +
|}
 +
 
 +
===Proof Example===
 +
 
 +
{| align="center" cellpadding="8" width="90%"
 +
|
 +
<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>
 +
|}
 +
 
 +
==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 &nbsp;<math>\Leftrightarrow</math>&nbsp; <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 &nbsp;<math>\Leftrightarrow</math>&nbsp; <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="8" width="90%"
 +
|
 +
<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>
 +
 +
<math>
 +
\begin{cases}
 +
a \\
 +
b \\
 +
c \\
 +
\begin{cases}
 +
d \\
 +
e \\
 +
f \\
 +
\end{cases} \\
 +
g \\
 +
h \\
 +
i \\
 +
\end{cases}
 +
</math>
 +
 +
<br>
 +
 +
<math>\begin{alignat}{2}
 +
x & = (y - z)(y + z) \\
 +
  & = y^2 - z^2      \\
 +
\end{alignat}</math>
 +
 +
<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>
 +
 +
<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>
 +
 +
<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>
 +
 +
<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>
Jon Awbrey
12,080

edits

Retrieved from "https://mywikibiz.com/Special:MobileDiff/76561...147172"