Prove the well-ordering Axiom by strong induction.© BrainMass Inc. brainmass.com November 24, 2021, 11:11 am ad1c9bdddf
Assume there is a proposition that is a function of a single natural number, that is P(x).
If P(1) is true
P(1) and P(2) and so on through P(n) imply P(n+1)
P(i) is true for all natural numbers.
Proof of Well-ordering axiom by strong induction:
We will do induction based on the size of the subset.
That is, the property P(i) in strong induction will ...
The well-ordering axiom is proven by strong induction is examined.