PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
[parent] Viewing Message
``Re: Reject proof by contradiction?'' by rmilson on 2006-06-27 07:13:10
Intuitionistic logic does not accommodate proof by contradiction. My opinion regarding the question of whether or not proof by contradiction is "accepted", is that the modern synthesis is renders this question somewhat moot. More important is a clear understanding of what is needed for a particular proof. An intuitionistic proof is regarded as "stronger" than a proof in classical logic. A finitary, constructive proof with computational complexity bounds would be considered even stronger. On the other side of the spectrum, one might ask "does the proof require the axiom of choice"? If it doesn't, the proof is "stronger".
[ reply | up | top ]
Interact
reply