Difference between revisions of "Family of Sets"

From GM-RKB
Jump to: navigation, search
 
Line 11: Line 11:
 
* <B>Counter-Example(s):</B>
 
* <B>Counter-Example(s):</B>
 
** a [[Subset]].
 
** a [[Subset]].
* <B>See:</B> [[Set Theory]], [[Class (Set Theory)]].
+
* <B>See:</B> [[Set Theory]], [[Class (Set Theory)]], [[Indexed Family]], [[Combinatorial Design]], [[Russell's Paradox]].
 
----
 
----
 
----
 
----

Latest revision as of 23:22, 10 November 2019

A Family of Sets is a set composed of subsets from a set.



References

2019

  • (Wikipedia, 2019) ⇒ https://en.wikipedia.org/wiki/Family_of_sets Retrieved:2019-11-10.
    • In set theory and related branches of mathematics, a collection F of subsets of a given set S is called a family of subsets of S, or a family of sets over S. More generally, a collection of any sets whatsoever is called a family of sets.

      The term "collection" is used here because, in some contexts, a family of sets may be allowed to contain repeated copies of any given member, and in other contexts it may form a proper class rather than a set.