12,080
edits
Changes
Directory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems (view source)
Revision as of 04:02, 1 October 2010
, 04:02, 1 October 2010→Praeclarum theorema : Proof by CAST: re-format
|}
|}
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:
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%"