12,080
edits
Changes
Directory:Jon Awbrey/Papers/Differential Logic and Dynamic Systems (view source)
Revision as of 15:10, 19 June 2007
, 15:10, 19 June 2007→Transformations of Type '''B'''<sup>2</sup> → '''B'''<sup>2</sup>
</font><br>
</font><br>
<pre>
<br><font face="courier new">
{| align="center" border="1" cellpadding="12" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:left; width:96%"
| |
|
| Df = ((u)(v)) + ((u + du)(v + dv)) |
{| align="left" border="0" cellpadding="12" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:left; width:100%"
| |
| width="8%" | D''f''
| Dg = ((u, v)) + ((u + du, v + dv)) |
| width="4%" | =
| |
| width="20%" | ((''u'')(''v''))
| width="4%" | +
</pre>
| width="64%" | ((''u'' + d''u'')(''v'' + d''v''))
|-
| width="8%" | D''g''
| width="4%" | =
| width="20%" | ((''u'', ''v''))
| width="4%" | +
| width="64%" | ((''u'' + d''u'', ''v'' + d''v''))
|}
|}
</font><br>
But these initial formulas are purely definitional, and help us little in understanding either the purpose of the operators or the meaning of their results. Working symbolically, let us apply the same method to the separate components ''f'' and ''g'' that we earlier used on ''J''. This work is recorded in Appendix 1 and a summary of the results is presented in Tables 66-i and 66-ii.
But these initial formulas are purely definitional, and help us little in understanding either the purpose of the operators or the meaning of their results. Working symbolically, let us apply the same method to the separate components ''f'' and ''g'' that we earlier used on ''J''. This work is recorded in Appendix 1 and a summary of the results is presented in Tables 66-i and 66-ii.