Changes

Line 1,401: Line 1,401:  
|}
 
|}
   −
By way of example, suppose that we are given the initial condition ''A''&nbsp;=&nbsp;d''A'' and the law d<sup>2</sup>''A''&nbsp;=&nbsp;(''A'').  Then, since "''A''&nbsp;=&nbsp;d''A''" &hArr; "''A''&nbsp;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.
+
By way of example, suppose that we are given the initial condition <math>A = \operatorname{d}A</math> and the law <math>\operatorname{d}^2 A = (A).</math> Since the equation <math>A = \operatorname{d}A</math> is logically equivalent to the disjunction <math>A \operatorname{d}A\ \operatorname{or}\ (A)(\operatorname{d}A),</math> we may infer two possible trajectories, as displayed in Table&nbsp;11.  In either of these cases, the state <math>(\operatorname{d}A)(\operatorname{d}^2 A)</math> is a stable attractor or a terminal condition for both starting points.
    
<font face="courier new">
 
<font face="courier new">
12,080

edits