[Home]Well-founded set

HomePage | Recent Changes | Preferences
Difference (from prior major revision) (no other diffs)

Changed: 1c1
A well-founded set is a set with a partial order such that it contains no infinite descending chains. If the order is a total order then the set is called a well-ordered set.
A well-founded set is a set with a partial order such that it contains no infinite descending chains. If the order is a total order then the set is called a well-ordered set.

Changed: 3c3
On reason that well-founded sets are interesting is because mathematical induction can be used on them.
One reason that well-founded sets are interesting is because transfinite induction can be used on them.
A well-founded set is a set with a partial order such that it contains no infinite descending chains. If the order is a total order then the set is called a well-ordered set.

One reason that well-founded sets are interesting is because transfinite induction can be used on them.

HomePage | Recent Changes | Preferences
This page is read-only | View other revisions
Last edited August 9, 2001 7:08 am by AxelBoldt (diff)
Search: