Encyclopedia > W > Well-founded relation
Well-founded relation
In mathematics, a binary relation, R, is well-founded (or wellfounded) on a class X if and only if every non-empty subset of X has an R-minimal element; that is, for every non-empty subset S of X, there is an element m of S such that for every element s of S, the pair (s,m) is not in R.
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)