12,140
edits
Changes
MyWikiBiz, Author Your Legacy — Tuesday November 04, 2025
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems (view source)
Revision as of 03:25, 19 August 2009
, 03:25, 19 August 2009→Analysis of contingent propositions: convert graphic
|}
|}
The final graph in the sequence of equivalents is a disjunctive normal form (DNF) for the proposition on the left hand side of the equation <math>\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))} = \texttt{(} p \texttt{(} q r \texttt{))}.</math> 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:
The final graph in the sequence of equivalents is a disjunctive normal form (DNF) for the proposition on the left hand side of the equation <math>\texttt{(} p \texttt{(} q \texttt{))(} p \texttt{(} r \texttt{))} = \texttt{(} p \texttt{(} q r \texttt{))}.</math>
{| align="center" cellpadding="8"
| [[Image:Logical Graph (P (Q)) (P (R)) DNF.jpg|500px]]
| (32)
|}
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="8" style="text-align:center; width:90%"
{| align="center" cellpadding="8" style="text-align:center; width:90%"
|
|
<pre>
<pre>
o-----------------------------------------------------------o
o-----------------------------------------------------------o
| |
| |
o-----------------------------------------------------------o
o-----------------------------------------------------------o
</pre>
</pre>
|}
|}
