|
|
![[parent]](http://images.planetmath.org:8080/images/uparrow.png) Viewing Message
|
|
|
| ``Re: Nested prooves by contraction?''
by Silentvoice on 2008-07-04 16:03:35 |
|
| Forgot to mention! If you've done any work with symbolic logic (specifically using Natural Deduction) then many theorems are deduced by nested contradiction arguments. Most notably the law of excluded middle.
There might be another way to do that one without nested contradiction arguments, but that's the way I've always done it.
Of course if you're into that intuitionism thing, then you'd bark at me for equating reductio ad absurdum with proof by contradiction. Just thought I'd add that little thing. |
| | [ reply | up | top ] |
|
|
|
|
|
|
