Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing


  • 3 years ago

Prove carefully that the well ordering principle implies the principal of mathematical induction. That is, suppose the P(n) is a predicate about natural numbers n. Suppose that P(1) is true, and suppose also that for all n ∈ N, P (n + 1) is true if P (n) is true. Using the well ordering principle prove that then P(n) is true for all n. (Hint: consider the set of natural numbers n for which P(n) is false.)

  • This Question is Closed

    Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy