12,080
edits
Changes
Directory talk:Jon Awbrey/Papers/Differential Propositional Calculus (view source)
Revision as of 13:20, 16 May 2008
, 13:20, 16 May 2008→Materials from "Dif Log Dyn Sys" for Reuse Here: add excerpts
=Materials from "Dif Log Dyn Sys" for Reuse Here=
=Materials from "Dif Log Dyn Sys" for Reuse Here=
Excerpts from "[[Differential Logic and Dynamic Systems]]"
==A Functional Conception of Propositional Calculus==
==A Functional Conception of Propositional Calculus==
We have just gone through a lot of work, apparently doing nothing more substantial than spinning a complex spell of notational devices through a labyrinth of baffled spaces and baffling maps. The reason for doing this was to bind together and to constitute the intuitive concept of a universe of discourse into a coherent categorical object, the kind of thing, once grasped, which can be turned over in the mind and considered in all its manifold changes and facets. The effort invested in these preliminary measures is intended to pay off later, when we need to consider the state transformations and the time evolution of neural network systems.
We have just gone through a lot of work, apparently doing nothing more substantial than spinning a complex spell of notational devices through a labyrinth of baffled spaces and baffling maps. The reason for doing this was to bind together and to constitute the intuitive concept of a universe of discourse into a coherent categorical object, the kind of thing, once grasped, which can be turned over in the mind and considered in all its manifold changes and facets. The effort invested in these preliminary measures is intended to pay off later, when we need to consider the state transformations and the time evolution of neural network systems.
==Back to the Beginning : Some Exemplary Universes==
<blockquote>
<p>I would have preferred to be enveloped in words,<br>
borne way beyond all possible beginnings.</p>
<p>Michel Foucault, ''The Discourse on Language'', [Fou, 215]</p>
</blockquote>
To anchor our understanding of differential logic, let us look at how the various concepts apply in the simplest possible concrete cases, where the initial dimension is only 1 or 2. In spite of the obvious simplicity of these cases, it is possible to observe how central difficulties of the subject begin to arise already at this stage.
===A One-Dimensional Universe===
<blockquote>
<p>There was never any more inception than there is now,<br>
Nor any more youth or age than there is now;<br>
And will never be any more perfection than there is now,<br>
Nor any more heaven or hell than there is now.</p>
<p>Walt Whitman, Leaves of Grass, [Whi, 28]</p>
</blockquote>
Let <font face="lucida calligraphy">X</font> = {''x''<sub>1</sub>} = {''A''} be an alphabet that represents one boolean variable or a single logical feature. In this example I am using the capital letter "''A''" in a more usual informal way, to name a feature and not a space, at variance with my formerly stated formal conventions. At any rate, the basis element
''A'' = ''x''<sub>1</sub> may be interpreted as a simple proposition or a coordinate projection ''A'' = ''x''<sub>1</sub> : '''B'''<sub>1</sub> <font face=symbol>'''¸>'''</font> '''B'''. The space ''X'' = 〈''A'' 〉 = {(''A''), ''A''} of points (cells, vectors, interpretations) has cardinality 2<sup>''n''</sup> = 2<sup>1</sup> = 2 and is isomorphic to '''B''' = {0, 1}. Moreover, ''X'' may be identified with the set of singular propositions {''x'' : '''B''' <font face=symbol>'''××>'''</font> '''B'''}. The space of linear propositions ''X''* = {hom : '''B''' <font face=symbol>'''+>'''</font> '''B'''} = {0, ''A''} is algebraically dual to ''X'' and also has cardinality 2. Here, "0" is interpreted as denoting the constant function 0 : '''B''' → '''B''', amounting to the linear proposition of rank 0, while ''A'' is the linear proposition of rank 1. Last but not least we have the positive propositions {pos : '''B''' <font face=symbol>'''¥>'''</font> '''B'''} = {''A'', 1}, of rank 1 and 0, respectively, where "1" is understood as denoting the constant function 1 : '''B''' → '''B'''. In sum, there are <math>2^{2^n} = 2^{2^1} = 4</math> propositions altogether in the universe of discourse, comprising the set ''X''^ = {f : ''X'' → '''B'''} = {0, (''A''), ''A'', 1} <math>\cong</math> ('''B''' → '''B''').
The first order differential extension of <font face="lucida calligraphy">X</font> is E<font face="lucida calligraphy">X</font> = {''x''<sub>1</sub>, d''x''<sub>1</sub>} = {''A'', d''A''}. If the feature "''A''" is understood as applying to some object or state, then the feature "d''A''" may be interpreted as an attribute of the same object or state that says that it is changing ''significantly'' with respect to the property ''A'', or that it has an ''escape velocity'' with respect to the state ''A''. In practice, differential features acquire their logical meaning through a class of ''temporal inference rules''.
For example, relative to a frame of observation that is left implicit for now, one is permitted to make the following sorts of inference: From the fact that ''A'' and d''A'' are true at a given moment one may infer that (''A'') will be true in the next moment of observation. Altogether in the present instance, there is the fourfold scheme of inference that is shown below:
<br><font face="courier new">
{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; text-align:center; width:96%"
|
{| align="center" border="0" cellpadding="8" cellspacing="0" style="background:lightcyan; text-align:center; width:96%"
| || From || (''A'') || and || (d''A'') || infer || (''A'') || next. ||
|-
| || From || (''A'') || and || d''A'' || infer || ''A'' || next. ||
|-
| || From || ''A'' || and || (d''A'') || infer || ''A'' || next. ||
|-
| || From || ''A'' || and || d''A'' || infer || (''A'') || next. ||
|}
|}
</font><br>
It might be thought that we need to bring in an independent time variable at this point, but an insight of fundamental importance appears to be that the idea of process is more basic than the notion of time. A time variable is actually a reference to a ''clock'', that is, a canonical or a convenient process that is established or accepted as a standard of measurement, but in essence no different than any other process. This raises the question of how different subsystems in a more global process can be brought into comparison, and what it means for one process to serve the function of a local standard for others. But these inquiries only wrap up puzzles in further riddles, and are obviously too involved to be handled at our current level of approximation.
<blockquote>
<p>The clock indicates the moment . . . . but what does<br>
eternity indicate?</p>
<p>Walt Whitman, 'Leaves of Grass', [Whi, 79]</p>
</blockquote>
Observe that the secular inference rules, used by themselves, involve a loss of information, since nothing in them can tell us whether the momenta {(d''A''), d''A''} are preserved or changed in the next instance. In order to know this, we would have to determine d<sup>2</sup>''A'', and so on, pursuing an infinite regress. Ultimately, in order to rest with a finitely determinate system, it is necessary to make an infinite assumption, for example, that d<sup>''k''</sup>''A'' = 0 for all ''k'' greater than some fixed value ''M''. Another way to escape the regress is through the provision of a dynamic law, in typical form making higher order differentials dependent on lower degrees and estates.
===Example 1. A Square Rigging===
<blockquote>
<p>Urge and urge and urge,<br>
Always the procreant urge of the world.</p>
<p>Walt Whitman, ''Leaves of Grass'', [Whi, 28]</p>
</blockquote>
By way of example, suppose that we are given the initial condition ''A'' = d''A'' and the law d<sup>2</sup>''A'' = (''A''). Then, since "''A'' = d''A''" ⇔ "''A'' d''A'' or (''A'')(d''A'')", we may infer two possible trajectories, as displayed in Table 11. In either of these cases, the state ''A''(d''A'')(d<sup>2</sup>''A'') is a stable attractor or a terminal condition for both starting points.
<font face="courier new">
{| align="center" border="1" cellpadding="6" cellspacing="0" style="background:lightcyan; text-align:center; width:96%"
|+ '''Table 11. A Pair of Commodious Trajectories'''
|- style="background:paleturquoise"
! Time
! Trajectory 1
! Trajectory 2
|-
|
{| align="center" border="0" cellpadding="6" cellspacing="0" style="background:lightcyan; text-align:center"
| 0
|-
| 1
|-
| 2
|-
| 3
|-
| 4
|}
|
{| align="center" border="0" cellpadding="6" cellspacing="0" style="background:lightcyan; text-align:center"
| ''A'' || d''A'' || (d<sup>2</sup>''A'')
|-
| (''A'') || d''A'' || d<sup>2</sup>''A''
|-
| ''A'' || (d''A'') || (d<sup>2</sup>''A'')
|-
| ''A'' || (d''A'') || (d<sup>2</sup>''A'')
|-
| " || " || "
|}
|
{| align="center" border="0" cellpadding="6" cellspacing="0" style="background:lightcyan; text-align:center"
| (''A'') || (d''A'') || d<sup>2</sup>''A''
|-
| (''A'') || d''A'' || d<sup>2</sup>''A''
|-
| ''A'' || (d''A'') || (d<sup>2</sup>''A'')
|-
| ''A'' || (d''A'') || (d<sup>2</sup>''A'')
|-
| " || " || "
|}
|}
</font><br>
Because the initial space ''X'' = 〈''A''〉 is one-dimensional, we can easily fit the second order extension E<sup>2</sup>''X'' = 〈''A'', d''A'', d<sup>2</sup>''A''〉 within the compass of a single venn diagram, charting the couple of converging trajectories as shown in Figure 12.
<br>
<p>[[Image:Diff Log Dyn Sys -- Figure 12 -- The Anchor.gif|center]]</p>
<p><center><font size="+1">'''Figure 12. The Anchor'''</font></center></p>
If we eliminate from view the regions of E<sup>2</sup>''X'' that are ruled out by the dynamic law d<sup>2</sup>''A'' = (''A''), then what remains is the quotient structure that is shown in Figure 13. This picture makes it easy to see that the dynamically allowable portion of the universe is partitioned between the properties ''A'' and d<sup>2</sup>''A''. As it happens, this fact might have been expressed "right off the bat" by an equivalent formulation of the differential law, one that uses the exclusive disjunction to state the law as (''A'', d<sup>2</sup>''A'').
<br>
<p>[[Image:Diff Log Dyn Sys -- Figure 13 -- The Tiller.gif|center]]</p>
<p><center><font size="+1">'''Figure 13. The Tiller'''</font></center></p>
What we have achieved in this example is to give a differential description of a simple dynamic process. In effect, we did this by embedding a directed graph, which can be taken to represent the state transitions of a finite automaton, in a dynamically allotted quotient structure that is created from a boolean lattice or an ''n''-cube by nullifying all of the regions that the dynamics outlaws. With growth in the dimensions of our contemplated universes, it becomes essential, both for human comprehension and for computer implementation, that the dynamic structures of interest to us be represented not actually, by acquaintance, but virtually, by description. In our present study, we are using the language of propositional calculus to express the relevant descriptions, and to comprehend the structure that is implicit in the subsets of a ''n''-cube without necessarily being forced to actualize all of its points.
One of the reasons for engaging in this kind of extremely reduced, but explicitly controlled case study is to throw light on the general study of languages, formal and natural, in their full array of syntactic, semantic, and pragmatic aspects. Propositional calculus is one of the last points of departure where we can view these three aspects interacting in a non-trivial way without being immediately and totally overwhelmed by the complexity they generate. Often this complexity causes investigators of formal and natural languages to adopt the strategy of focusing on a single aspect and to abandon all hope of understanding the whole, whether it's the still living natural language or the dynamics of inquiry that lies crystallized in formal logic.
From the perspective that I find most useful here, a language is a syntactic system that is designed or evolved in part to express a set of descriptions. When the explicit symbols of a language have extensions in its object world that are actually infinite, or when the implicit categories and generative devices of a linguistic theory have extensions in its subject matter that are potentially infinite, then the finite characters of terms, statements, arguments, grammars, logics, and rhetorics force an excess of intension to reside in all these symbols and functions, across the spectrum from the object language to the metalinguistic uses. In the aphorism from W. von Humboldt that Chomsky often cites, for example, in [Cho86, 30] and [Cho93, 49], language requires "the infinite use of finite means". This is necessarily true when the extensions are infinite, when the referential symbols and grammatical categories of a language possess infinite sets of models and instances. But it also voices a practical truth when the extensions, though finite at every stage, tend to grow at exponential rates.
This consequence of dealing with extensions that are "practically infinite" becomes crucial when one tries to build neural network systems that learn, since the learning competence of any intelligent system is limited to the objects and domains that it is able to represent. If we want to design systems that operate intelligently with the full deck of propositions dealt by intact universes of discourse, then we must supply them with succinct representations and efficient transformations in this domain. Furthermore, in the project of constructing inquiry driven systems, we find ourselves forced to contemplate the level of generality that is embodied in propositions, because the dynamic evolution of these systems is driven by the measurable discrepancies that occur among their expectations, intentions, and observations, and because each of these subsystems or components of knowledge constitutes a propositional modality that can take on the fully generic character of an empirical summary or an axiomatic theory.
A compression scheme by any other name is a symbolic representation, and this is what the differential extension of propositional calculus, through all of its many universes of discourse, is intended to supply. Why is this particular program of mental calisthenics worth carrying out in general? By providing a uniform logical medium for describing dynamic systems we can make the task of understanding complex systems much easier, both in looking for invariant representations of individual cases and in finding points of comparison among diverse structures that would otherwise appear as isolated systems. All of this goes to facilitate the search for compact knowledge and to adapt what is learned from individual cases to the general realm.
===Back to the Feature===
<blockquote>
<p>I guess it must be the flag of my disposition, out of hopeful<br>
green stuff woven.</p>
<p>Walt Whitman, ''Leaves of Grass'', [Whi, 31]</p>
</blockquote>
Let us assume that the sense intended for differential features is well enough established in the intuition, for now, that I may continue with outlining the structure of the differential extension [E<font face="lucida calligraphy">X</font>] = [''A'', d''A'']. Over the extended alphabet E<font face="lucida calligraphy">X</font> = {''x''<sub>1</sub>, d''x''<sub>1</sub>} = {''A'', d''A''}, of cardinality 2<sup>''n''</sup> = 2, we generate the set of points, E''X'', of cardinality 2<sup>2''n''</sup> = 4, that bears the following chain of equivalent descriptions:
:{| cellpadding=2
| E''X''
| =
| 〈''A'', d''A''〉
|-
|
| =
| {(''A''), ''A''} × {(d''A''), d''A''}
|-
|
| =
| {(''A'')(d''A''), (''A'') d''A'', ''A'' (d''A''), ''A'' d''A''}.
|}
The space E''X'' may be assigned the mnemonic type '''B''' × '''D''', which is really no different than '''B''' × '''B''' = '''B'''<sup>2</sup>. An individual element of E''X'' may be regarded as a ''disposition at a point'' or a ''situated direction'', in effect, a singular mode of change occurring at a single point in the universe of discourse. In applications, the modality of this change can be interpreted in various ways, for example, as an expectation, an intention, or an observation with respect to the behavior of a system.
To complete the construction of the extended universe of discourse E''X''<sup> •</sup> = [''x''<sub>1</sub>, d''x''<sub>1</sub>] = [''A'', d''A''], one must add the set of differential propositions E''X''^ = {''g'' : E''X'' → '''B'''} <math>\cong</math> ('''B''' × '''D''' → '''B''') to the set of dispositions in E''X''. There are <math>2^{2^{2n}}</math> = 16 propositions in E''X''^, as detailed in Table 14.
{| align="center" border="1" cellpadding="6" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:96%"
|+ '''Table 14. Differential Propositions'''
|- style="background:paleturquoise"
|
| align="right" | A :
| 1 1 0 0
|
|
|
|- style="background:paleturquoise"
|
| align="right" | dA :
| 1 0 1 0
|
|
|
|-
| f<sub>0</sub>
| g<sub>0</sub>
| 0 0 0 0
| ( )
| False
| 0
|-
|
{| style="background:lightcyan"
|
<br>
<br>
<br>
|}
|
{| style="background:lightcyan"
|
g<sub>1</sub><br>
g<sub>2</sub><br>
g<sub>4</sub><br>
g<sub>8</sub>
|}
|
{| style="background:lightcyan"
|
0 0 0 1<br>
0 0 1 0<br>
0 1 0 0<br>
1 0 0 0
|}
|
{| style="background:lightcyan"
|
(A)(dA)<br>
(A) dA <br>
A (dA)<br>
A dA
|}
|
{| style="background:lightcyan"
|
Neither A nor dA<br>
Not A but dA<br>
A but not dA<br>
A and dA
|}
|
{| style="background:lightcyan"
|
¬A ∧ ¬dA<br>
¬A ∧ dA<br>
A ∧ ¬dA<br>
A ∧ dA
|}
|-
|
{| style="background:lightcyan"
|
f<sub>1</sub><br>
f<sub>2</sub>
|}
|
{| style="background:lightcyan"
|
g<sub>3</sub><br>
g<sub>12</sub>
|}
|
{| style="background:lightcyan"
|
0 0 1 1<br>
1 1 0 0
|}
|
{| style="background:lightcyan"
|
(A)<br>
A
|}
|
{| style="background:lightcyan"
|
Not A<br>
A
|}
|
{| style="background:lightcyan"
|
¬A<br>
A
|}
|-
|
{| style="background:lightcyan"
|
<br>
|}
|
{| style="background:lightcyan"
|
g<sub>6</sub><br>
g<sub>9</sub>
|}
|
{| style="background:lightcyan"
|
0 1 1 0<br>
1 0 0 1
|}
|
{| style="background:lightcyan"
|
(A, dA)<br>
((A, dA))
|}
|
{| style="background:lightcyan"
|
A not equal to dA<br>
A equal to dA
|}
|
{| style="background:lightcyan"
|
A ≠ dA<br>
A = dA
|}
|-
|
{| style="background:lightcyan"
|
<br>
|}
|
{| style="background:lightcyan"
|
g<sub>5</sub><br>
g<sub>10</sub>
|}
|
{| style="background:lightcyan"
|
0 1 0 1<br>
1 0 1 0
|}
|
{| style="background:lightcyan"
|
(dA)<br>
dA
|}
|
{| style="background:lightcyan"
|
Not dA<br>
dA
|}
|
{| style="background:lightcyan"
|
¬dA<br>
dA
|}
|-
|
{| style="background:lightcyan"
|
<br>
<br>
<br>
|}
|
{| style="background:lightcyan"
|
g<sub>7</sub><br>
g<sub>11</sub><br>
g<sub>13</sub><br>
g<sub>14</sub>
|}
|
{| style="background:lightcyan"
|
0 1 1 1<br>
1 0 1 1<br>
1 1 0 1<br>
1 1 1 0
|}
|
{| style="background:lightcyan"
|
(A dA)<br>
(A (dA))<br>
((A) dA)<br>
((A)(dA))
|}
|
{| style="background:lightcyan"
|
Not both A and dA<br>
Not A without dA<br>
Not dA without A<br>
A or dA
|}
|
{| style="background:lightcyan"
|
¬A ∨ ¬dA<br>
A → dA<br>
A ← dA<br>
A ∨ dA
|}
|-
| f<sub>3</sub>
| g<sub>15</sub>
| 1 1 1 1
| (( ))
| True
| 1
|}
<br>
Aside from changing the names of variables and shuffling the order of rows, this Table follows the format that was used previously for boolean functions of two variables. The rows are grouped to reflect natural similarity classes among the propositions. In a future discussion, these classes will be given additional explanation and motivation as the orbits of a certain transformation group acting on the set of 16 propositions. Notice that four of the propositions, in their logical expressions, resemble those given in the table for ''X''^. Thus the first set of propositions {''f''<sub>''i''</sub>} is automatically embedded in the present set {''g''<sub>''j''</sub>}, and the corresponding inclusions are indicated at the far left margin of the table.
===Tacit Extensions===
<blockquote>
<p>I would really like to have slipped imperceptibly into this lecture, as into all the others I shall be delivering, perhaps over the years ahead.</p>
<p>Michel Foucault, ''The Discourse on Language'', [Fou, 215]</p>
</blockquote>
Strictly speaking, however, there is a subtle distinction in type between the function ''f''<sub>''i''</sub> : ''X'' → '''B''' and the corresponding function ''g''<sub>''j''</sub> : E''X'' → '''B''', even though they share the same logical expression. Being human, we insist on preserving all the aesthetic delights afforded by the abstractly unified form of the "cake" while giving up none of the diverse contents that its substantive consummation can provide. In short, we want to maintain the logical equivalence of expressions that represent the same proposition, while appreciating the full diversity of that proposition's functional and typical representatives. Both perspectives, and all the levels of abstraction extending through them, have their reasons, as will develop in time.
Because this special circumstance points up an important general theme, it is a good idea to discuss it more carefully. Whenever there arises a situation like this, where one alphabet <font face="lucida calligraphy">X</font> is a subset of another alphabet <font face="lucida calligraphy">Y</font>, then we say that any proposition ''f'' : 〈<font face="lucida calligraphy">X</font>〉 → ''B'' has a ''tacit extension'' to a proposition <math>\epsilon</math>''f'' : 〈<font face="lucida calligraphy">Y</font>〉 → '''B''', and that the space (〈<font face="lucida calligraphy">X</font>〉 → '''B''') has an ''automatic embedding'' within the space (〈<font face="lucida calligraphy">Y</font>〉 → '''B'''). The extension is defined in such a way that <math>\epsilon</math>''f'' puts the same constraint on the variables of <font face="lucida calligraphy">X</font> that are contained in <font face="lucida calligraphy">Y</font> as the proposition ''f'' initially did, while it puts no constraint on the variables of <font face="lucida calligraphy">Y</font> outside of <font face="lucida calligraphy">X</font>, in effect, conjoining the two constraints.
If the variables in question are indexed as <font face="lucida calligraphy">X</font> = {''x''<sub>1</sub>, …, ''x''<sub>''n''</sub>} and <font face="lucida calligraphy">Y</font> = {''x''<sub>1</sub>, …, ''x''<sub>''n''</sub>, …, ''x''<sub>''n''+''k''</sub>}, then the definition of the tacit extension from <font face="lucida calligraphy">X</font> to <font face="lucida calligraphy">Y</font> may be expressed in the form of an equation:
: <math>\epsilon</math>''f''(''x''<sub>1</sub>, …, ''x''<sub>''n''</sub>, …, ''x''<sub>''n''+''k''</sub>) = ''f''(''x''<sub>1</sub>, …, ''x''<sub>''n''</sub>).
On formal occasions, such as the present context of definition, the tacit extension from <font face="lucida calligraphy">X</font> to <font face="lucida calligraphy">Y</font> is explicitly symbolized by the operator <math>\epsilon</math> : (〈<font face="lucida calligraphy">X</font>〉 → '''B''') → (〈<font face="lucida calligraphy">Y</font>〉 → '''B'''), where the appropriate alphabets <font face="lucida calligraphy">X</font> and <font face="lucida calligraphy">Y</font> are understood from context, but normally one may leave the "<math>\epsilon</math>" silent.
Let's explore what this means for the present Example. Here, <font face="lucida calligraphy">X</font> = {''A''} and <font face="lucida calligraphy">Y</font> = E<font face="lucida calligraphy">X</font> = {''A'', d''A''}. For each of the propositions ''f''<sub>''i''</sub> over ''X'', specifically, those whose expression ''e''<sub>''i''</sub> lies in the collection {0, (''A''), ''A'', 1}, the tacit extension <math>\epsilon</math>''f'' of ''f'' to E''X'' can be phrased as a logical conjunction of two factors, ''f''<sub>''i''</sub> = ''e''<sub>''i''</sub> '''·''' <math>\tau</math> , where <math>\tau</math> is a logical tautology that uses all the variables of <font face="lucida calligraphy">Y</font> – <font face="lucida calligraphy">X</font>. Working in these terms, the tacit extensions <math>\epsilon</math>''f'' of ''f'' to E''X'' may be explicated as shown in Table 15.
<font face="courier new">
{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; text-align:center; width:96%"
|+ '''Table 15. Tacit Extension of [''A''] to [''A'', d''A'']'''
|
{| align="center" border="0" cellpadding="8" cellspacing="0" style="background:lightcyan; text-align:center; width:96%"
|
| 0
| =
| 0
| ·
| ((d''A''), d''A'')
| =
| 0
|
|-
|
| (''A'')
| =
| (''A'')
| ·
| ((d''A''), d''A'')
| =
| (''A'')(d''A'') + (''A'') d''A''
|
|-
|
| ''A''
| =
| ''A''
| ·
| ((d''A''), d''A'')
| =
| ''A'' (d''A'') + ''A'' d''A''
|
|-
|
| 1
| =
| 1
| ·
| ((d''A''), d''A'')
| =
| 1
|}
|}
</font><br>
In its effect on the singular propositions over ''X'', this analysis has an interesting interpretation. The tacit extension takes us from thinking about a particular state, like ''A'' or (''A''), to considering the collection of outcomes, the outgoing changes or the singular dispositions, that spring from that state.
===Example 2. Drives and Their Vicissitudes===
<blockquote>
<p>I open my scuttle at night and see the far-sprinkled systems,<br>
And all I see, multiplied as high as I can cipher, edge but<br>
the rim of the farther systems.</p>
<p>Walt Whitman, ''Leaves of Grass'', [Whi, 81]</p>
</blockquote>
Before we leave the one-feature case let's look at a more substantial example, one that illustrates a general class of curves that can be charted through the extended feature spaces and that provides an opportunity to discuss a number of important themes concerning their structure and dynamics.
Again, let <font face="lucida calligraphy">X</font> = {''x''<sub>1</sub>} = {''A''}. In the discussion that follows I will consider a class of trajectories having the property that d<sup>''k''</sup>''A'' = 0 for all ''k'' greater than some fixed ''m'', and I indulge in the use of some picturesque terms that describe salient classes of such curves. Given the finite order condition, there is a highest order non-zero difference d<sup>''m''</sup>''A'' exhibited at each point in the course of any determinate trajectory that one may wish to consider. With respect to any point of the corresponding orbit or curve let us call this highest order differential feature d<sup>''m''</sup>''A'' the ''drive'' at that point. Curves of constant drive d<sup>''m''</sup>''A'' are then referred to as "''m''<sup>th</sup> gear curves".
* '''Scholium.''' The fact that a difference calculus can be developed for boolean functions is well known [Fuji], [Koh, § 8-4] and was probably familiar to Boole, who was an expert in difference equations before he turned to logic. And of course there is the strange but true story of how the Turin machines of the 1840's prefigured the Turing machines of the 1940's [Men, 225-297]. At the very outset of general purpose, mechanized computing we find that the motive power driving the Analytical Engine of Babbage, the kernel of an idea behind all of his wheels, was exactly his notion that difference operations, suitably trained, can serve as universal joints for any conceivable computation [M&M], [Mel, ch. 4].
Given this language, the particular Example that I take up here can be described as the family of 4<sup>th</sup> gear curves through E<sup>4</sup>''X'' = 〈''A'', d''A'', d<sup>2</sup>''A'', d<sup>3</sup>''A'', d<sup>4</sup>''A''〉. These are the trajectories generated subject to the dynamic law d<sup>4</sup>''A'' = 1, where it is understood in such a statement that all higher order differences are equal to 0. Since d<sup>4</sup>''A'' and all higher d<sup>''k''</sup>''A'' are fixed, the temporal or transitional conditions (initial, mediate, terminal - transient or stable states) vary only with respect to their projections as points of E<sup>3</sup>''X'' = 〈''A'', d''A'', d<sup>2</sup>''A'', d<sup>3</sup>''A''〉. Thus, there is just enough space in a planar venn diagram to plot all of these orbits and to show how they partition the points of E<sup>3</sup>''X''. It turns out that there are exactly two possible orbits, of eight points each, as illustrated in Figure 16.
<br>
<p>[[Image:Diff Log Dyn Sys -- Figure 16 -- A Couple of Fourth Gear Orbits.gif|center]]</p>
<p><center><font size="+1">'''Figure 16. A Couple of Fourth Gear Orbits'''</font></center></p>
With a little thought it is possible to devise an indexing scheme for the general run of dynamic states that allows for comparing universes of discourse that weigh in on different scales of observation. With this end in sight, let us index the states ''q'' in E<sup>''m''</sup>''X'' with the dyadic rationals (or the binary fractions) in the half-open interval [0, 2). Formally and canonically, a state ''q''<sub>''r''</sub> is indexed by a fraction ''r'' = ''s''/''t'' whose denominator is the power of two ''t'' = 2<sup>''m''</sup> and whose numerator is a binary numeral that is formed from the coefficients of state in a manner to be described next. The ''differential coefficients'' of the state ''q'' are just the values d<sup>''k''</sup>''A''(''q''), for ''k'' = 0 to ''m'', where d<sup>0</sup>''A'' is defined as being identical to ''A''. To form the binary index d<sub>0</sub>'''.'''d<sub>1</sub>…d<sub>''m''</sub> of the state ''q'' the coefficient d<sup>''k''</sup>''A''(''q'') is read off as the binary digit ''d''<sub>''k''</sub> associated with the place value 2<sup>–''k''</sup>. Expressed by way of algebraic formulas, the rational index ''r'' of the state ''q'' can be given by the following equivalent formulations:
<br><font face="courier new">
{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; text-align:center; width:96%"
|
{| align="center" border="0" cellpadding="8" cellspacing="0" style="background:lightcyan; text-align:center; width:96%"
| <math>r(q)\!</math>
| <math>=</math>
| <math>\sum_k d_k \cdot 2^{-k}</math>
| <math>=</math>
| <math>\sum_k \mbox{d}^k A(q) \cdot 2^{-k}</math>
|-
| <math>=</math>
|-
| <math>\frac{s(q)}{t}</math>
| <math>=</math>
| <math>\frac{\sum_k d_k \cdot 2^{(m-k)}}{2^m}</math>
| <math>=</math>
| <math>\frac{\sum_k \mbox{d}^k A(q) \cdot 2^{(m-k)}}{2^m}</math>
|}
|}
</font><br>
Applied to the example of fourth gear curves, this scheme results in the data of Tables 17-a and 17-b, which exhibit one period for each orbit. The states in each orbit are listed as ordered pairs ‹''p''<sub>''i''</sub>, ''q''<sub>''j''</sub>›, where ''p''<sub>''i''</sub> may be read as a temporal parameter that indicates the present time of the state, and where ''j'' is the decimal equivalent of the binary numeral ''s''. Informally and more casually, the Tables exhibit the states ''q''<sub>''s''</sub> as subscripted with the numerators of their rational indices, taking for granted the constant denominators of 2<sup>''m''</sup> = 2<sup>4</sup> = 16. Within this set-up, the temporal successions of states can be reckoned as given by a kind of ''parallel round-up rule''. That is, if ‹''d''<sub>''k''</sub>, ''d''<sub>''k''+1</sub>› is any pair of adjacent digits in the state index ''r'', then the value of ''d''<sub>''k''</sub> in the next state is ''d''<sub>''k''</sub>′ = ''d''<sub>''k''</sub> + ''d''<sub>''k''+1</sub>.
{| align="center" border="1" cellpadding="6" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:96%"
|+ '''Table 17-a. A Couple of Orbits in Fourth Gear: Orbit 1'''
|- style="background:paleturquoise"
| Time
| State
| ''A''
| d''A''
|
|
|
|- style="background:paleturquoise"
| ''p''<sub>''i''</sub>
| ''q''<sub>''j''</sub>
| d<sup>0</sup>''A''
| d<sup>1</sup>''A''
| d<sup>2</sup>''A''
| d<sup>3</sup>''A''
| d<sup>4</sup>''A''
|-
|
{| align="center" border="0" cellpadding="6" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center"
| ''p''<sub>0</sub>
|-
| ''p''<sub>1</sub>
|-
| ''p''<sub>2</sub>
|-
| ''p''<sub>3</sub>
|-
| ''p''<sub>4</sub>
|-
| ''p''<sub>5</sub>
|-
| ''p''<sub>6</sub>
|-
| ''p''<sub>7</sub>
|}
|
{| align="center" border="0" cellpadding="6" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center"
| ''q''<sub>01</sub>
|-
| ''q''<sub>03</sub>
|-
| ''q''<sub>05</sub>
|-
| ''q''<sub>15</sub>
|-
| ''q''<sub>17</sub>
|-
| ''q''<sub>19</sub>
|-
| ''q''<sub>21</sub>
|-
| ''q''<sub>31</sub>
|}
| colspan="5" |
{| align="center" border="0" cellpadding="6" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:100%"
| 0. || 0 || 0 || 0 || 1
|-
| 0. || 0 || 0 || 1 || 1
|-
| 0. || 0 || 1 || 0 || 1
|-
| 0. || 1 || 1 || 1 || 1
|-
| 1. || 0 || 0 || 0 || 1
|-
| 1. || 0 || 0 || 1 || 1
|-
| 1. || 0 || 1 || 0 || 1
|-
| 1. || 1 || 1 || 1 || 1
|}
|}
<br>
{| align="center" border="1" cellpadding="6" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:96%"
|+ '''Table 17-b. A Couple of Orbits in Fourth Gear: Orbit 2'''
|- style="background:paleturquoise"
| Time
| State
| ''A''
| d''A''
|
|
|
|- style="background:paleturquoise"
| ''p''<sub>''i''</sub>
| ''q''<sub>''j''</sub>
| d<sup>0</sup>''A''
| d<sup>1</sup>''A''
| d<sup>2</sup>''A''
| d<sup>3</sup>''A''
| d<sup>4</sup>''A''
|-
|
{| align="center" border="0" cellpadding="6" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center"
| ''p''<sub>0</sub>
|-
| ''p''<sub>1</sub>
|-
| ''p''<sub>2</sub>
|-
| ''p''<sub>3</sub>
|-
| ''p''<sub>4</sub>
|-
| ''p''<sub>5</sub>
|-
| ''p''<sub>6</sub>
|-
| ''p''<sub>7</sub>
|}
|
{| align="center" border="0" cellpadding="6" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center"
| ''q''<sub>25</sub>
|-
| ''q''<sub>11</sub>
|-
| ''q''<sub>29</sub>
|-
| ''q''<sub>07</sub>
|-
| ''q''<sub>09</sub>
|-
| ''q''<sub>27</sub>
|-
| ''q''<sub>13</sub>
|-
| ''q''<sub>23</sub>
|}
| colspan="5" |
{| align="center" border="0" cellpadding="6" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:100%"
| 1. || 1 || 0 || 0 || 1
|-
| 0. || 1 || 0 || 1 || 1
|-
| 1. || 1 || 1 || 0 || 1
|-
| 0. || 0 || 1 || 1 || 1
|-
| 0. || 1 || 0 || 0 || 1
|-
| 1. || 1 || 0 || 1 || 1
|-
| 0. || 1 || 1 || 0 || 1
|-
| 1. || 0 || 1 || 1 || 1
|}
|}
<br>
==Work Area==