: Matemáticas: well-ordered set

set theory > ordinal number > well-ordered set

well-ordered set

In mathematics, a well-order (or well-ordering or well-order relation) on a set S is a total ordering on S with the property that every non-empty subset of S has a least element in this ordering. The set S together with the ordering is then called a well-ordered set. In some academic articles and textbooks these terms are instead written as wellorder, wellordered, and wellordering or well order, well ordered, and well ordering.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Well-order)

http://data.loterre.fr/ark:/67375/PSR-RTKRMZZL-Q

RDF/XML TURTLE JSON-LD Creado 21/8/23, última modificación 18/10/24

Loterre