Disjoint Set Relation

A disjoint set relation is an n-ary set relation that is TRUE if the Intersection Set Operation is FALSE for all set member combinations (no common members).

• AKA: Disjoint Set, Distinct Set, Distinct Set Relation.
• Context:
  • It can be used to define a Set of Disjoint Sets.
  • …
• Counter-Example(s):
  • an Overlapping Set Relation.
• See: Set Intersection, Distinct Set, Set (Mathematics), Element (Mathematics), Intersection (Set Theory), Empty Set.

---

---

References

2014

• (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/Disjoint_sets Retrieved:2014-4-21.
  • In mathematics, two sets are said to be disjoint if they have no element in common. Equivalently, disjoint sets are sets whose intersection is the empty set.

    For example, {1, 2, 3} and {4, 5, 6} are disjoint sets.

---