MyWikiBiz, Author Your Legacy — Tuesday November 26, 2024
Jump to navigationJump to search
1 byte removed
, 21:00, 3 December 2008
Line 19: |
Line 19: |
| ===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: |
Line 183: |
Line 183: |
| 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]] |