Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is a proof by contradiction in everyday mathematical terms?

  • A.Demonstrating that a counterexample cannot be constructed
  • B.Assuming the negation and deriving an impossibility
  • C.Showing that two premises contradict one another directly
  • D.Proving a statement by proving its contrapositive instead

Answer: B

The mathematical technique and machine refutation are the same idea: assume the opposite and show that something impossible follows. Recognising the correspondence makes the prover's strategy familiar rather than strange. Direct contradiction between premises, contraposition and non-constructive arguments are related but distinct. A machine procedure that turns out to formalise a technique already familiar from mathematics is easier to trust and easier to debug.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.