Math 2.0

Concept

Prewellordering

Summary

In set theory, a prewellordering on a set XX is a preorder ≤\leq on XX (a transitive and reflexive relation on XX) that is strongly connected (meaning that any two points are comparable) and well-founded in the sense that the induced relation x<yx < y defined by x≤y and y≰xx \leq y \text{ and } y \nleq x is a well-founded relation.

Further reading

  1. Wikipedia, page 2137523, revision 1273597295, Prewellordering. adopted
About this page
TagWDNCGJAEWN
URIm2://WDNCGJAEWN
Aliasesnorm-descriptive-set-theory, prewellordering-property, reduction-property, regular-norm
Kindconcept
WritingW1 stated
Same as
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.