12,080
edits
Changes
→Logical Equivalence Problem: 2 spaces after period → 1 space after period
===Solution===
===Solution===
[http://mathforum.org/kb/plaintext.jspa?messageID=6514666 Solution posted by Jon Awbrey, using the calculus of logical graphs].
[http://mathforum.org/kb/plaintext.jspa?messageID=6514666 Solution posted by Jon Awbrey, employing the calculus of logical graphs].
In logical graphs, the required equivalence looks like this:
In logical graphs, the required equivalence looks like this:
Proceeding from these axioms is a handful of very simple theorems that we tend to use over and over in deriving more complex theorems. A sample of these frequently used theorems is given here:
Proceeding from these axioms is a handful of very simple theorems that we tend to use over and over in deriving more complex theorems. A sample of these frequently used theorems is given here:
:* [[Logical_graph#C1.__Double_negation_theorem|C<sub>1</sub>. Double Negation Theorem]]
:* [[Logical_graph#C1._Double_negation_theorem|C<sub>1</sub>. Double Negation Theorem]]
:* [[Logical_graph#C2.__Generation_theorem|C<sub>2</sub>. Generation Theorem]]
:* [[Logical_graph#C2._Generation_theorem|C<sub>2</sub>. Generation Theorem]]
:* [[Logical_graph#C3.__Dominant_form_theorem|C<sub>3</sub>. Dominant Form Theorem]]
:* [[Logical_graph#C3._Dominant_form_theorem|C<sub>3</sub>. Dominant Form Theorem]]