Bifalgorithm post · Brisk · Chapter 1
Why can sets of sets lead to Russell’s Paradox?
Why can sets of sets lead to Russell’s Paradox? (Brisk · Chapter 1) — "Sets are heterogeneous — a single set can contain four universities, seven integers, and…
Ideas in this flowchart
- Sets can contain very different objects, including other sets, but unrestricted self-reference creates paradoxes.
- A single set may contain four universities, seven integers, and an ahi tuna.
- Sets can also contain other sets.
- Thinking about unrestricted sets of sets can quickly lead to serious logical problems.
- In 1901, Bertrand Russell showed that this idea can produce unresolvable contradictions without constraints.
- Russell considered R, the set of all sets that do not contain themselves as members.
- Is R a member of itself?
- If R is a member of itself, it violates the definition of R.
- If R is not a member of itself, it satisfies the definition and must be a member of R.
- Avoiding self-referential membership makes working with sets comparatively safe.
