A differential propositional calculus is a propositional calculus extended by a set of terms for describing aspects of change and difference, for example, processes that take place in a universe of discourse or transformations that map a source universe into a target universe.
1. Casual Introduction
Consider the situation represented by the venn diagram in Figure 1.
|
Figure 1. Local Habitations, And Names
|
The area of the rectangle represents a universe of discourse, X. This might be a population of individuals having various additional properties or it might be a collection of locations that various individuals occupy. The area of the "circle" represents the individuals that have the property q or the locations that fall within the corresponding region Q. Four individuals, a,b,c,d, are singled out by name. It happens that b and c currently reside in region Q while a and d do not.
Now consider the situation represented by the venn diagram in Figure 2.
|
Figure 2. Same Names, Different Habitations
|
Figure 2 differs from Figure 1 solely in the circumstance that the object c is outside the region Q while the object d is inside the region Q. So far, there is nothing that says that our encountering these Figures in this order is other than purely accidental, but if we interpret the present sequence of frames as a "moving picture" representation of their natural order in a temporal process, then it would be natural to say that a and b have remained as they were with regard to quality q while c and d have changed their standings in that respect. In particular, c has moved from the region where q is true to the region where q is false while d has moved from the region where q is false to the region where q is true.
Figure 1′ reprises the situation shown in Figure 1, but this time interpolates a new quality that is specifically tailored to account for the relation between Figure 1 and Figure 2.
|
Figure 1′. Back, To The Future
|
This new quality, dq, is an example of a differential quality, since its absence or presence qualifies the absence or presence of change occurring in another quality. As with any other quality, it is represented in the venn diagram by means of a "circle" that distinguishes two halves of the universe of discourse, in this case, the portions of X outside and inside the region dQ.
Figure 1 represents a universe of discourse, X, together with a basis of discussion, {q}, for expressing propositions about the contents of that universe. Once the quality q is given a name, say, the symbol "q", we have the basis for a formal language that is specifically cut out for discussing X in terms of q, and this formal language is more formally known as the propositional calculus with alphabet {"q"}.
In the context marked by X and {q} there are but four different pieces of information that can be expressed in the corresponding propositional calculus, namely, the propositionsfalse, ¬q, q, true. Referring to the sample of points in Figure 1, false holds of no points, ¬q holds of a and d, q holds of b and c, and true holds of all points in the sample.
Figure 1′ preserves the same universe of discourse and extends the basis of discussion to a set of two qualities, {q,dq}. In parallel fashion, the initial propositional calculus is extended by means of the enlarged alphabet, {"q", "dq"}. Any propositional calculus over two basic propositions allows for the expression of 16 propositions all together. Just by way of salient examples in the present setting, we can pick out the most informative propositions that apply to each of our sample points. Using overlines to express logical negation, these are given as follows:
Table 3 exhibits the rules of inference that give the differential quality dq its meaning in practice.
Table 3. Differential Inference Rules
|
|
From
|
¯q
|
and
|
¯dq
|
infer
|
¯q
|
next.
|
|
|
|
From
|
¯q
|
and
|
dq
|
infer
|
q
|
next.
|
|
|
|
From
|
q
|
and
|
¯dq
|
infer
|
q
|
next.
|
|
|
|
From
|
q
|
and
|
dq
|
infer
|
¯q
|
next.
|
|
|
2. Cactus Calculus
Table 4 outlines a syntax for propositional calculus based on two types of logical connectives, both of variable k-ary scope.
- A bracketed list of propositional expressions in the form (e1,e2,…,ek−1,ek) indicates that exactly one of the propositions e1,e2,…,ek−1,ek is false.
- A concatenation of propositional expressions in the form e1 e2 … ek−1 ek indicates that all of the propositions e1,e2,…,ek−1,ek are true, in other words, that their logical conjunction is true.
Table 4. Syntax and Semantics of a Propositional Calculus
| Expression
|
Interpretation
|
Other Notations
|
|
|
True
|
1
|
| ( )
|
False
|
0
|
| x
|
x
|
x
|
| (x)
|
Not x
|
x′˜x¬x
|
| x y z
|
x and y and z
|
x∧y∧z
|
| ((x)(y)(z))
|
x or y or z
|
x∨y∨z
|
| (x (y))
|
x implies yIf x then y
|
x⇒y
|
| (x,y)
|
x not equal to yx exclusive or y
|
x≠yx+y
|
| ((x,y))
|
x is equal to yx if and only if y
|
x=yx⇔y
|
| (x,y,z)
|
Just one ofx,y,zis false.
|
x′y z ∨x y′z ∨x y z′
|
| ((x),(y),(z))
|
Just one ofx,y,zis true.Partition allinto x,y,z.
|
x y′z′∨x′y z′∨x′y′z
|
|
((x,y),z)(x,(y,z))
|
Oddly many ofx,y,zare true.
|
x+y+z
x y z ∨x y′z′∨x′y z′∨x′y′z
|
| (w,(x),(y),(z))
|
Partition winto x,y,z.Genus w comprisesspecies x,y,z.
|
w′x′y′z′∨w x y′z′∨w x′y z′∨w x′y′z
|
All other propositional connectives can be obtained through combinations of these two forms. Strictly speaking, the concatenation form is dispensable in light of the bracket form, but it is convenient to maintain it as an abbreviation for more complicated bracket expressions. The briefest expression for logical truth is the empty word, abstractly denoted ε or λ in formal languages, where it forms the identity element for concatenation. It can be given visible expression in this context by means of the logically equivalent expression "(( ))", or, especially if operating in an algebraic context, by a simple "1". Also when working in an algebraic mode, the plus sign "+ may be used for exclusive disjunction. For example, we have the following paraphrases of algebraic expressions by bracket expressions:
x+y=(x,y)
x+y+z=((x,y),z)=(x,(y,z))
It is important to note that the last expressions are not equivalent to the triple bracket (x,y,z).
For more information about this syntax for propositional calculus, see the entries on minimal negation operators, zeroth order logic, and Table A1 in Appendix 1.
3. Formal Development
The preceding discussion outlined the ideas leading to the differential extension of propositional logic. The next task is to lay out the concepts and terminology that are needed to describe various orders of differential propositional calculi.
3.1. Elementary Notions
Logical description of a universe of discourse begins with a set of logical signs. For the sake of simplicity in a first approach, assume that these logical signs are collected in the form of a finite alphabet, A={ “a1” ,…, “an” }. Each of these signs is interpreted as denoting a logical feature, for instance, a property that objects in the universe of discourse may have or a proposition about objects in the universe of discourse. Corresponding to the alphabet A there is then a set of logical features, A={a1,…,an}.
A set of logical features, A={a1,…,an}, affords a basis for generating an n-dimensional universe of discourse, written A∘=[A]=[a1,…,an]. It is useful to consider a universe of discourse as a categorical object that incorporates both the set of points A=⟨a1,…,an⟩ and the set of propositions A↑={f:A→B} that are implicit with the ordinary picture of a venn diagram on n features. Accordingly, the universe of discourse A∘ may be regarded as an ordered pair (A,A↑) having the type (Bn,(Bn→B)), and this last type designation may be abbreviated as Bn +→B, or even more succinctly as [Bn]. For convenience, the data type of a finite set on n elements may be indicated by either one of the equivalent notations, [n] or n.
Table 5 summarizes the notations that are needed to describe ordinary propositional calculi in a systematic fashion.
Table 5. Propositional Calculus : Basic Notation
| Symbol
|
Notation
|
Description
|
Type
|
| A
|
{ “a1” ,…, “an” }
|
Alphabet
|
[n]=n
|
| A
|
{a1,…,an}
|
Basis
|
[n]=n
|
| Ai
|
{¯ai,ai}
|
Dimension i
|
B
|
| A
|
⟨A⟩
⟨a1,…,an⟩
{(a1,…,an)}
A1×…×An
∏iAi
|
Set of cells,
coordinate tuples,
points, or vectors
in the universe
of discourse
|
Bn
|
| A∗
|
(hom:A→B)
|
Linear functions
|
(Bn)∗≅Bn
|
| A↑
|
(A→B)
|
Boolean functions
|
Bn→B
|
| A∘
|
[A]
(A,A↑)
(A +→B)
(A,(A→B))
[a1,…,an]
|
Universe of discourse
based on the features
{a1,…,an}
|
(Bn,(Bn→B))
(Bn +→B)
[Bn]
|
3.2. Special Classes of Propositions
A basic proposition, coordinate proposition, or simple proposition in the universe of discourse [a1,…,an] is one of the propositions in the set {a1,…,an}.
Among the 22n propositions in [a1,…,an] are several families of 2n propositions each that take on special forms with respect to the basis {a1,…,an}. Three of these families are especially prominent in the present context, the linear, the positive, and the singular propositions. Each family is naturally parameterized by the coordinate n-tuples in Bn and falls into n+1 ranks, with a binomial coefficient (nk) giving the number of propositions that have rank or weight k.
In each case the rank k ranges from 0 to n and counts the number of positive appearances of the coordinate propositions a1,…,an in the resulting expression. For example, for n=3, the linear proposition of rank 0 is 0, the positive proposition of rank 0 is 1, and the singular proposition of rank 0 is (a1)(a2)(a3).
The basic propositions ai:Bn→B are both linear and positive. So these two kinds of propositions, the linear and the positive, may be viewed as two different ways of generalizing the class of basic propositions.
Finally, it is important to note that all of the above distinctions are relative to the choice of a particular logical basis A={a1,…,an}. For example, a singular proposition with respect to the basis A will not remain singular if A is extended by a number of new and independent features. Even if one keeps to the original set of pairwise options {ai}∪{(ai)} to pick out a new basis, the sets of linear propositions and positive propositions are both determined by the choice of basic propositions, and this whole determination is tantamount to the purely conventional choice of a cell as origin.
3.3. Differential Extensions
An initial universe of discourse, A∘, supplies the groundwork for any number of further extensions, beginning with the first order differential extension, EA∘. The construction of EA∘ can be described in the following stages:
The initial alphabet, A={ “a1” ,…, “an” }, is extended by a first order differential alphabet, dA={ “da1” ,…, “dan” }, resulting in a first order extended alphabet, EA, defined as follows:
EA=A ∪ dA={ “a1” ,…, “an”, “da1” ,…, “dan” }.
The initial basis, A={a1,…,an}, is extended by a first order differential basis, dA={da1,…,dan}, resulting in a first order extended basis, EA, defined as follows:
EA=A ∪ dA={a1,…,an,da1,…,dan}.
The initial space, A=⟨a1,…,an⟩, is extended by a first order differential space or tangent space, dA=⟨da1,…,dan⟩, at each point of A, resulting in a first order extended space or tangent bundle space, EA, defined as follows:
EA=A×dA=⟨EA⟩=⟨A∪dA⟩=⟨a1,…,an,da1,…,dan⟩.
Finally, the initial universe, A∘=[a1,…,an], is extended by a first order differential universe or tangent universe, dA∘=[da1,…,dan], at each point of A∘, resulting in a first order extended universe or tangent bundle universe, EA∘, defined as follows:
EA∘=[EA]=[A ∪ dA]=[a1,…,an,da1,…,dan].
This gives EA∘ the type:
[Bn×Dn]=(Bn×Dn +→B)=(Bn×Dn,Bn×Dn→B).
A proposition in a differential extension of a universe of discourse is called a differential proposition and forms the analogue of a system of differential equations in ordinary calculus. With these constructions, the first order extended universe EA∘ and the first order differential proposition f:EA→B, we have arrived, in concept at least, at the foothills of differential logic.
Table 6 summarizes the notations that are needed to describe the first order differential extensions of propositional calculi in a systematic manner.
Table 6. Differential Extension : Basic Notation
| Symbol
|
Notation
|
Description
|
Type
|
| dA
|
{ “da1” ,…, “dan” }
|
Alphabet of
differential
symbols
|
[n]=n
|
| dA
|
{da1,…,dan}
|
Basis of
differential
features
|
[n]=n
|
| dAi
|
{¯dai,dai}
|
Differential
dimension i
|
D
|
| dA
|
⟨dA⟩
⟨da1,…,dan⟩
{(da1,…,dan)}
dA1×…×dAn
∏idAi
|
Tangent space
at a point:
Set of changes,
motions, steps,
tangent vectors
at a point
|
Dn
|
| dA∗
|
(hom:dA→B)
|
Linear functions
on dA
|
(Dn)∗≅Dn
|
| dA↑
|
(dA→B)
|
Boolean functions
on dA
|
Dn→B
|
| dA∘
|
[dA]
(dA,dA↑)
(dA +→B)
(dA,(dA→B))
[da1,…,dan]
|
Tangent universe
at a point of A∘,
based on the
tangent features
{da1,…,dan}
|
(Dn,(Dn→B))
(Dn +→B)
[Dn]
|
…
Appendices
Appendix 1
Propositional Forms on Two Variables
Table A1. Propositional Forms on Two Variables
Table A1. Propositional Forms on Two Variables
| L1
|
L2
|
L3
|
L4
|
L5
|
L6
|
|
|
|
|
|
|
|
|
|
f0000
|
f0001
|
f0010
|
f0011
|
f0100
|
f0101
|
f0110
|
f0111
|
|
| 0 0 0 0
|
| 0 0 0 1
|
| 0 0 1 0
|
| 0 0 1 1
|
| 0 1 0 0
|
| 0 1 0 1
|
| 0 1 1 0
|
| 0 1 1 1
|
|
( )
|
(x)(y)
|
(x) y
|
(x)
|
x (y)
|
(y)
|
(x, y)
|
(x y)
|
|
false
|
neither x nor y
|
y without x
|
not x
|
x without y
|
not y
|
x not equal to y
|
not both x and y
|
|
0
|
¬x∧¬y
|
¬x∧y
|
¬x
|
x∧¬y
|
¬y
|
x≠y
|
¬x∨¬y
|
|
f8
|
f9
|
f10
|
f11
|
f12
|
f13
|
f14
|
f15
|
|
f1000
|
f1001
|
f1010
|
f1011
|
f1100
|
f1101
|
f1110
|
f1111
|
|
| 1 0 0 0
|
| 1 0 0 1
|
| 1 0 1 0
|
| 1 0 1 1
|
| 1 1 0 0
|
| 1 1 0 1
|
| 1 1 1 0
|
| 1 1 1 1
|
|
x y
|
((x, y))
|
y
|
(x (y))
|
x
|
((x) y)
|
((x)(y))
|
(( ))
|
|
x and y
|
x equal to y
|
y
|
not x without y
|
x
|
not y without x
|
x or y
|
true
|
|
x∧y
|
x=y
|
y
|
x⇒y
|
x
|
x⇐y
|
x∨y
|
1
|
|
Table A2. Propositional Forms on Two Variables
Table A2. Propositional Forms on Two Variables
| L1
|
L2
|
L3
|
L4
|
L5
|
L6
|
|
|
|
|
|
|
|
f0
|
f0000
|
0 0 0 0
|
( )
|
false
|
1
|
|
|
|
0 0 0 1
|
0 0 1 0
|
0 1 0 0
|
1 0 0 0
|
|
|
neither x nor y
|
y without x
|
x without y
|
x and y
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
x not equal to y
|
x equal to y
|
|
|
|
|
|
|
|
|
|
|
|
|
0 1 1 1
|
1 0 1 1
|
1 1 0 1
|
1 1 1 0
|
|
(x y)
|
(x (y))
|
((x) y)
|
((x)(y))
|
|
not both x and y
|
not x without y
|
not y without x
|
x or y
|
|
|
f15
|
f1111
|
1 1 1 1
|
(( ))
|
true
|
1
|
Table A3. Ef Expanded Over Differential Features
Table A3. Ef Expanded Over Differential Features {dx,dy}
|
|
f
|
|
|
|
|
| f0
|
( )
|
( )
|
( )
|
( )
|
( )
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| (x y)
|
| (x (y))
|
| ((x) y)
|
| ((x)(y))
|
|
| ((x)(y))
|
| ((x) y)
|
| (x (y))
|
| (x y)
|
|
| ((x) y)
|
| ((x)(y))
|
| (x y)
|
| (x (y))
|
|
| (x (y))
|
| (x y)
|
| ((x)(y))
|
| ((x) y)
|
|
| (x y)
|
| (x (y))
|
| ((x) y)
|
| ((x)(y))
|
|
| f15
|
(( ))
|
(( ))
|
(( ))
|
(( ))
|
(( ))
|
| Fixed Point Total :
|
4
|
4
|
4
|
16
|
Table A4. Df Expanded Over Differential Features
Table A4. Df Expanded Over Differential Features {dx,dy}
|
|
f
|
Df|dx dy
|
Df|dx(dy)
|
Df|(dx)dy
|
Df|(dx)(dy)
|
| f0
|
( )
|
( )
|
( )
|
( )
|
( )
|
|
|
|
| ((x, y))
|
| (x, y)
|
| (x, y)
|
| ((x, y))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| (x y)
|
| (x (y))
|
| ((x) y)
|
| ((x)(y))
|
|
| ((x, y))
|
| (x, y)
|
| (x, y)
|
| ((x, y))
|
|
|
|
|
| f15
|
(( ))
|
( )
|
( )
|
( )
|
( )
|
Table A5. Ef Expanded Over Ordinary Features
Table A5. Ef Expanded Over Ordinary Features {x,y}
|
|
f
|
Ef|xy
|
Ef|x(y)
|
Ef|(x)y
|
Ef|(x)(y)
|
| f0
|
( )
|
( )
|
( )
|
( )
|
( )
|
|
|
|
| dx dy
|
| dx (dy)
|
| (dx) dy
|
| (dx)(dy)
|
|
| dx (dy)
|
| dx dy
|
| (dx)(dy)
|
| (dx) dy
|
|
| (dx) dy
|
| (dx)(dy)
|
| dx dy
|
| dx (dy)
|
|
| (dx)(dy)
|
| (dx) dy
|
| dx (dy)
|
| dx dy
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| (x y)
|
| (x (y))
|
| ((x) y)
|
| ((x)(y))
|
|
| ((dx)(dy))
|
| ((dx) dy)
|
| (dx (dy))
|
| (dx dy)
|
|
| ((dx) dy)
|
| ((dx)(dy))
|
| (dx dy)
|
| (dx (dy))
|
|
| (dx (dy))
|
| (dx dy)
|
| ((dx)(dy))
|
| ((dx) dy)
|
|
| (dx dy)
|
| (dx (dy))
|
| ((dx) dy)
|
| ((dx)(dy))
|
|
| f15
|
(( ))
|
(( ))
|
(( ))
|
(( ))
|
(( ))
|
Table A6. Df Expanded Over Ordinary Features
Table A6. Df Expanded Over Ordinary Features {x,y}
|
|
f
|
Df|xy
|
Df|x(y)
|
Df|(x)y
|
Df|(x)(y)
|
| f0
|
( )
|
( )
|
( )
|
( )
|
( )
|
|
|
|
| dx dy
|
| dx (dy)
|
| (dx) dy
|
| ((dx)(dy))
|
|
| dx (dy)
|
| dx dy
|
| ((dx)(dy))
|
| (dx) dy
|
|
| (dx) dy
|
| ((dx)(dy))
|
| dx dy
|
| dx (dy)
|
|
| ((dx)(dy))
|
| (dx) dy
|
| dx (dy)
|
| dx dy
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| (x y)
|
| (x (y))
|
| ((x) y)
|
| ((x)(y))
|
|
| ((dx)(dy))
|
| (dx) dy
|
| dx (dy)
|
| dx dy
|
|
| (dx) dy
|
| ((dx)(dy))
|
| dx dy
|
| dx (dy)
|
|
| dx (dy)
|
| dx dy
|
| ((dx)(dy))
|
| (dx) dy
|
|
| dx dy
|
| dx (dy)
|
| (dx) dy
|
| ((dx)(dy))
|
|
| f15
|
(( ))
|
( )
|
( )
|
( )
|
( )
|
Appendix 2
Differential Forms
The actions of the difference operator D and the tangent operator d on the 16 propositional forms in two variables are shown in the Tables below.
Table A7 expands the resulting differential forms over a logical basis:
{(dx)(dy), dx(dy), (dx)dy, dxdy}.
This set consists of the singular propositions in the first order differential variables, indicating mutually exclusive and exhaustive cells of the tangent universe of discourse. Accordingly, this set of differential propositions may also be referred to as the cell-basis, point-basis, or singular differential basis. In this setting it is frequently convenient to use the following abbreviations:
∂x=dx(dy) and ∂y=(dx)dy.
Table A8 expands the resulting differential forms over an algebraic basis:
{1, dx, dy, dxdy}.
This set consists of the positive propositions in the first order differential variables, indicating overlapping positive regions of the tangent universe of discourse. Accordingly, this set of differential propositions may also be referred to as the positive differential basis.
Table A7. Differential Forms Expanded on a Logical Basis
Table A7. Differential Forms Expanded on a Logical Basis
|
|
f
|
Df
|
df
|
| f0
|
( )
|
0
|
0
|
|
|
|
|
(y)dx (dy)+(x)(dx) dy+((x,y))dx dyydx (dy)+(x)(dx) dy+(x,y)dx dy(y)dx (dy)+x(dx) dy+(x,y)dx dyydx (dy)+x(dx) dy+((x,y))dx dy
|
|
|
(y)∂x+(x)∂yy∂x+(x)∂y(y)∂x+x∂yy∂x+x∂y
|
|
|
|
|
|
dx (dy)+dx dydx (dy)+dx dy
|
|
|
|
|
|
|
dx (dy)+(dx) dydx (dy)+(dx) dy
|
|
|
|
|
|
|
(dx) dy+dx dy(dx) dy+dx dy
|
|
|
|
|
|
|
ydx (dy)+x(dx) dy+((x,y))dx dy(y)dx (dy)+x(dx) dy+(x,y)dx dyydx (dy)+(x)(dx) dy+(x,y)dx dy(y)dx (dy)+(x)(dx) dy+((x,y))dx dy
|
|
|
y∂x+x∂y(y)∂x+x∂yy∂x+(x)∂y(y)∂x+(x)∂y
|
|
| f15
|
(( ))
|
0
|
0
|
Table A8. Differential Forms Expanded on an Algebraic Basis
Table A8. Differential Forms Expanded on an Algebraic Basis
|
|
f
|
Df
|
df
|
| f0
|
( )
|
0
|
0
|
|
|
|
|
(y)dx+(x)dy+dx dyydx+(x)dy+dx dy(y)dx+xdy+dx dyydx+xdy+dx dy
|
|
|
(y)dx+(x)dyydx+(x)dy(y)dx+xdyydx+xdy
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ydx+xdy+dx dy(y)dx+xdy+dx dyydx+(x)dy+dx dy(y)dx+(x)dy+dx dy
|
|
|
ydx+xdy(y)dx+xdyydx+(x)dy(y)dx+(x)dy
|
|
| f15
|
(( ))
|
0
|
0
|
Appendix 3
Table A9. Taylor Series Expansion
Table A9. Taylor Series Expansion Df=df+d2f
|
|
df=
∂xf⋅dx + ∂yf⋅dy
|
d2f=
∂xyf⋅dxdy
|
df|xy
|
df|x(y)
|
df|(x)y
|
df|(x)(y)
|
| f0
|
0
|
0
|
0
|
0
|
0
|
0
|
|
|
|
(y)dx+(x)dyydx+(x)dy(y)dx+xdyydx+xdy
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ydx+xdy(y)dx+xdyydx+(x)dy(y)dx+(x)dy
|
|
|
|
|
|
|
| f15
|
0
|
0
|
0
|
0
|
0
|
0
|
Table A10. Partial Differentials and Relative Differentials
Table A10. Partial Differentials and Relative Differentials
|
|
f
|
∂f∂x
|
∂f∂y
|
df=
∂xf⋅dx + ∂yf⋅dy
|
∂x∂y|f
|
∂y∂x|f
|
| f0
|
( )
|
0
|
0
|
0
|
0
|
0
|
|
|
|
|
|
|
(y)dx+(x)dyydx+(x)dy(y)dx+xdyydx+xdy
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ydx+xdy(y)dx+xdyydx+(x)dy(y)dx+(x)dy
|
|
|
|
| f15
|
(( ))
|
0
|
0
|
0
|
0
|
0
|
Appendix 4
Table A11. Detail of Calculation for the Difference Map
Table A11. Detail of Calculation for Df=Ef+f
|
|
Ef|dx dy+f|dx dy=Df|dx dy
|
Ef|dx (dy)+f|dx (dy)=Df|dx (dy)
|
Ef|(dx) dy+f|(dx) dy=Df|(dx) dy
|
Ef|(dx)(dy)+f|(dx)(dy)=Df|(dx)(dy)
|
| f0
|
0+0=0
|
0+0=0
|
0+0=0
|
0+0=0
|
|
|
|
xydxdy+(x)(y)dxdy=((x,y))dxdy
|
|
x(y)dxdy+(x)ydxdy=(x,y)dxdy
|
|
(x)ydxdy+x(y)dxdy=(x,y)dxdy
|
|
(x)(y)dxdy+xydxdy=((x,y))dxdy
|
|
|
x(y)dx(dy)+(x)(y)dx(dy)=(y)dx(dy)
|
|
xydx(dy)+(x)ydx(dy)=ydx(dy)
|
|
(x)(y)dx(dy)+x(y)dx(dy)=(y)dx(dy)
|
|
(x)ydx(dy)+xydx(dy)=ydx(dy)
|
|
|
(x)y(dx)dy+(x)(y)(dx)dy=(x)(dx)dy
|
|
(x)(y)(dx)dy+(x)y(dx)dy=(x)(dx)dy
|
|
xy(dx)dy+x(y)(dx)dy=x(dx)dy
|
|
x(y)(dx)dy+xy(dx)dy=x(dx)dy
|
|
|
(x)(y)(dx)(dy)+(x)(y)(dx)(dy)=0(dx)(dy)
|
|
(x) y(dx)(dy)+(x) y(dx)(dy)=0(dx)(dy)
|
|
x (y)(dx)(dy)+x (y)(dx)(dy)=0(dx)(dy)
|
|
x y(dx)(dy)+x y(dx)(dy)=0(dx)(dy)
|
|
|
|
|
xdxdy+(x)dxdy=1dxdy
|
|
(x)dxdy+xdxdy=1dxdy
|
|
|
xdx(dy)+(x)dx(dy)=1dx(dy)
|
|
(x)dx(dy)+xdx(dy)=1dx(dy)
|
|
|
(x)(dx)dy+(x)(dx)dy=0(dx)dy
|
|
x(dx)dy+x(dx)dy=0(dx)dy
|
|
|
(x)(dx)(dy)+(x)(dx)(dy)=0(dx)(dy)
|
|
x(dx)(dy)+x(dx)(dy)=0(dx)(dy)
|
|
|
|
|
(x,y)dxdy+(x,y)dxdy=0dxdy
|
|
((x,y))dxdy+((x,y))dxdy=0dxdy
|
|
|
((x,y))dx(dy)+(x,y)dx(dy)=1dx(dy)
|
|
(x,y)dx(dy)+((x,y))dx(dy)=1dx(dy)
|
|
|
((x,y))(dx)dy+(x,y)(dx)dy=1(dx)dy
|
|
(x,y)(dx)dy+((x,y))(dx)dy=1(dx)dy
|
|
|
(x,y)(dx)(dy)+(x,y)(dx)(dy)=0(dx)(dy)
|
|
((x,y))(dx)(dy)+((x,y))(dx)(dy)=0(dx)(dy)
|
|
|
|
|
ydxdy+(y)dxdy=1dxdy
|
|
(y)dxdy+ydxdy=1dxdy
|
|
|
(y)dx(dy)+(y)dx(dy)=0dx(dy)
|
|
ydx(dy)+ydx(dy)=0dx(dy)
|
|
|
y(dx)dy+(y)(dx)dy=1(dx)dy
|
|
(y)(dx)dy+y(dx)dy=1(dx)dy
|
|
|
(y)(dx)(dy)+(y)(dx)(dy)=0(dx)(dy)
|
|
y(dx)(dy)+y(dx)(dy)=0(dx)(dy)
|
|
|
|
|
((x)(y))dxdy+(xy)dxdy=((x,y))dxdy
|
|
((x)y)dxdy+(x(y))dxdy=(x,y)dxdy
|
|
(x(y))dxdy+((x)y)dxdy=(x,y)dxdy
|
|
(xy)dxdy+((x)(y))dxdy=((x,y))dxdy
|
|
|
((x)y)dx(dy)+(xy)dx(dy)=ydx(dy)
|
|
((x)(y))dx(dy)+(x(y))dx(dy)=(y)dx(dy)
|
|
(xy)dx(dy)+((x)y)dx(dy)=ydx(dy)
|
|
(x(y))dx(dy)+((x)(y))dx(dy)=(y)dx(dy)
|
|
|
(x(y))(dx)dy+(xy)(dx)dy=x(dx)dy
|
|
(xy)(dx)dy+(x(y))(dx)dy=x(dx)dy
|
|
((x)(y))(dx)dy+((x)y)(dx)dy=(x)(dx)dy
|
|
((x)y)(dx)dy+((x)(y))(dx)dy=(x)(dx)dy
|
|
|
(x y)(dx)(dy)+(x y)(dx)(dy)=0(dx)(dy)
|
|
(x (y))(dx)(dy)+(x (y))(dx)(dy)=0(dx)(dy)
|
|
((x) y)(dx)(dy)+((x) y)(dx)(dy)=0(dx)(dy)
|
|
((x)(y))(dx)(dy)+((x)(y))(dx)(dy)=0(dx)(dy)
|
|
| f15
|
1+1=0
|
1+1=0
|
1+1=0
|
1+1=0
|
References
- Ashby, William Ross (1956/1964), An Introduction to Cybernetics, Chapman and Hall, London, UK, 1956. Reprinted, Methuen and Company, London, UK, 1964.
- Awbrey, J., and Awbrey, S. (1989), "Theme One : A Program of Inquiry", Unpublished Manuscript, 09 Aug 1989. Microsoft Word Document.
- Edelman, Gerald M. (1988), Topobiology : An Introduction to Molecular Embryology, Basic Books, New York, NY.
- Leibniz, Gottfried Wilhelm, Freiherr von, Theodicy : Essays on the Goodness of God, The Freedom of Man, and The Origin of Evil, Austin Farrer (ed.), E.M. Huggard (trans.), based on C.J. Gerhardt (ed.), Collected Philosophical Works, 1875–1890, Routledge and Kegan Paul, London, UK, 1951. Reprinted, Open Court, La Salle, IL, 1985.
- McClelland, James L., and Rumelhart, David E. (1988), Explorations in Parallel Distributed Processing : A Handbook of Models, Programs, and Exercises, MIT Press, Cambridge, MA.
