Changes

Line 1,053: Line 1,053:  
|}
 
|}
   −
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 can 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>  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%"
12,080

edits