transfinite induction
(redirected from Well-ordered induction)transfinite induction
[tranz′fī‚nīt in′dək·shən] (mathematics)
A reasoning process by which if a theorem holds true for the first element of a well-ordered set N and is true for an element n whenever it holds for all predecessors of n, then the theorem is true for all members of N.