Category:Definitions/Total Orderings
Jump to navigation
Jump to search
This category contains definitions related to Total Orderings.
Related results can be found in Category:Total Orderings.
Let $\RR \subseteq S \times S$ be a relation on a set $S$.
$\RR$ is a total ordering on $S$ if and only if:
That is, $\RR$ is an ordering with no non-comparable pairs:
- $\forall x, y \in S: x \mathop \RR y \lor y \mathop \RR x$
Subcategories
This category has the following 5 subcategories, out of 5 total.
C
G
L
O
W
Pages in category "Definitions/Total Orderings"
The following 22 pages are in this category, out of 22 total.
S
T
- Definition:Toset
- Definition:Total Ordering
- Definition:Total Ordering (Class Theory)
- Definition:Total Ordering/Also known as
- Definition:Total Ordering/Class Theory
- Definition:Total Ordering/Definition 1
- Definition:Total Ordering/Definition 2
- Definition:Totally Ordered Commutative Semigroup
- Definition:Totally Ordered Field
- Definition:Totally Ordered Group
- Definition:Totally Ordered Semigroup
- Definition:Totally Ordered Set
- Definition:Totally Ordered Structure