Optimization of ordered sets 1970-01-01
Wellfoundedness 1970-01-01
Wellfoundedness is a concept primarily used in mathematical logic and set theory, particularly in the context of order relations and transfinite induction. A relation \( R \) on a set \( S \) is said to be well-founded if every non-empty subset of \( S \) has a minimal element with respect to the relation \( R \). In simpler terms, this means that there are no infinite descending chains of elements.
1/3–2/3 conjecture 1970-01-01
Alexandrov topology 1970-01-01
Amoeba order 1970-01-01
Antichain 1970-01-01
Aronszajn line 1970-01-01
Atom (order theory) 1970-01-01
Better-quasi-ordering 1970-01-01
Betweenness 1970-01-01
Bounded complete poset 1970-01-01
Cantor–Bernstein theorem 1970-01-01
Causal sets 1970-01-01
Centered set 1970-01-01
Chain-complete partial order 1970-01-01
Cofinal (mathematics) 1970-01-01
Compact element 1970-01-01
Comparability 1970-01-01
Complete partial order 1970-01-01
Completely distributive lattice 1970-01-01