1

I saw this post, whose answer states that within certain systems of logic, there are statements that can only be proven by contradiction. If we only consider classical logic, is it still true that there are things that can only be proven by contradiction?

Simplex
  • 159

4 Answers4

2

No. Since $(\text{not }A) \implies B$ is equivalent to $(\text{not } B) \implies A$, any proof of the following form:

  1. Suppose (not A)
  2. Then B
  3. But (not B)
  4. Therefore A.

can be rewritten as

  1. (not B)
  2. (not B) implies A
  3. Therefore A.
Robert Israel
  • 448,999
  • Thanks. I thought the only way to prove that the contrapositive is equivalent was by contradiction, but I just discovered that's not true. – Simplex Jul 02 '17 at 06:29
  • There is a small little problem: how do you prove the equivalence between the formulas $\neg A \rightarrow B$ and $\neg B \rightarrow A$? The only way I can think of make use of the reduction ad absurdum hence by contradiction. – Giorgio Mossa Jul 02 '17 at 11:47
  • Giorgio, I thought so too at first, but you could do it like this – Simplex Jul 03 '17 at 23:49
0

There are certain cases which are easier to proof by contradiction, rather than applying straightforward logic.

For example, if we need to show that √2 is irrational, we simply prove that by contradiction, because it's easier than other methods.

By general, we cannot tell instantly that weather we need to use contradictive method, but see if it is shorter than others or lengthy.

Fghj
  • 1,471
0

Any assertion $P$ is logically equivalent to $\neg P\Rightarrow{\rm false}$. So its just proving an equivalent statement. As said, some proofs are easier using contradition.

Wuestenfux
  • 20,964
0

If you consider formal proof systems, then the answer is yes: in some (many?) formal proof systems you cannot do without proof by contradiction for some proofs.

You can prove that you need the proof by contradiction by proving that without it, the proof system is not complete. And to prove that, you have to use non-classical semantics where, for example, statements can take on values other than just true or false. This can all be made hard mathematically, though often the proof can be tedious.

More informally and intuitively, though, take any of the many proof systems that have a pair of Introduction and Elimination rules for each connective (see the Wikipedia page on Natural Deduction for an example). Typically, the $\neg Intro$ is the formalization of the proof by contradiction (that is: if some assumption $P$ leads to a contradiction, then we can derive $\neg P$, i.e. introduce a $\neg$). Now, if we remove $\neg Intro$ from the system, then it is intuitively true that we can no longer derive something like $\neg \neg P$ from $P$. Again, that is no hard proof, but you can certainly 'tell' that something is missing.

Bram28
  • 100,612
  • 6
  • 70
  • 118