Definition:Comparable Sets/Subset Ordering
< Definition:Comparable Sets(Redirected from Definition:Comparable Sets by Subset Ordering)
Jump to navigation
Jump to search
Definition
Let $S$ and $T$ be sets.
Then $S$ and $T$ are comparable (with respect to the subset ordering) if and only if either:
- $S \subseteq T$
or:
- $T \subseteq S$
or both.
Also see
- Results about comparable sets can be found here.
Sources
- 2010: Raymond M. Smullyan and Melvin Fitting: Set Theory and the Continuum Problem (revised ed.) ... (previous) ... (next): Chapter $3$: The Natural Numbers: $\S 4$ A double induction principle and its applications: Definition $4.5$