Google
×
Well-founded relation

Well-founded relation

In mathematics, a binary relation R is called well-founded on a set or, more generally, a class X if every non-empty subset S ⊆ X has a minimal element with respect to R; that is, there exists an m ∈ S such that, for every s ∈ S, one does not have... Wikipedia