12,080
edits
Changes
Directory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems (view source)
Revision as of 03:02, 28 August 2009
, 03:02, 28 August 2009→Example: convert graphics
|}
|}
What we have harvested is the succulent equivalent of a ''disjunctive normal form'' (DNF) for the proposition with which we started. Remembering that a blank node is the graphical equivalent of a logical value ''true'', we can read this brand of DNF in the following manner:
What we have harvested is the succulent equivalent of a ''disjunctive normal form'' (DNF) for the proposition with which we started.
{| align="center" cellpadding="8"
| [[Image:Praeclarum Theorema DNF.jpg|500px]]
| (24)
|}
Remembering that a blank node is the graphical equivalent of a logical value <math>\operatorname{true},</math> the resulting DNF may be read as follows:
{| align="center" cellpadding="10" style="text-align:center; width:90%"
{| align="center" cellpadding="10" style="text-align:center; width:90%"
|
|
<pre>
<pre>
o-----------------------------------------------------------o
o-----------------------------------------------------------o
| |
| |
o-----------------------------------------------------------o
o-----------------------------------------------------------o
</pre>
</pre>
|}
|}