Encyclopedia > Well ordering theorem

  Article Content

Well-ordering principle

Redirected from Well ordering theorem

Sometimes the phrase "well-ordering principle" is taken to be synonymous with "well-ordering_theorem". On other occasions the phrase is taken to mean the proposition that the set of natural numbers {1, 2, 3, ....} is well-ordered, i.e., each of its non-empty subsets has a smallest member. In the second sense, the phrase is used when that proposition is relied on for the purpose of justifying proof that take the following form: to prove that every natural number belongs to a specified set S, assume the contrary and infer the existence of a smallest counterexample. Then show that there must be a still smaller counterexample, getting a contradiction. This mode of argument bears the same relation to proof by mathematical induction that "If not B then not A" bears to "If A then B".



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Canadian Charter of Rights and Freedoms

... a lawyer and to be informed of that right, and the right to an interpreter in a court proceeding are examples mobility rights: the right to enter and leave Canada, and ...

 
 
 
This page was created in 36.9 ms