Well-Founded Induction

- Natural & Formal Sciences -
Mathematics & Logic Dictionary
Definition
The principle that if a relation R on a set is well-founded (there are no infinite descending R-chains), and whenever an element x has the property provided all R-smaller elements do, then every element has that property; it generalizes ordinary induction on the naturals to arbitrary well-founded orders.