The reductio ad absurdum rule discharges an assumption from a derivation of contradiction and concludes . It is derivable using negation introduction followed by double-negation elimination:
(1)
Conversely, if RAA is supplied, double-negation elimination follows from this natural deduction derivation:
1. ¬¬φ                  premise
2.   ¬φ                 assumption [i]
3.   ⊥                  ¬E, 1, 2
4. φ                    RAA, 2–3, discharging [i]
Thus replacing double-negation elimination by RAA leaves these classical deductions available. RAA is not being assumed as an intuitionistic rule.

Ancestors (12)

  1. a
  2. 7
  3. Digital systems, linear algebra, introduction to formal proof
  4. 2018
  5. Past exam of the year 1 of the computer science course of the University of Oxford
  6. Year 1 of the computer science course of the University of Oxford
  7. Computer science course of the University of Oxford
  8. Undergraduate course of the University of Oxford
  9. Course of the University of Oxford
  10. University of Oxford
  11. List of universities
  12. Home

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version