The set of all sets does not exist.

  • Context: MHB 
  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Set Sets
Click For Summary
SUMMARY

The discussion centers on Russell's paradox and the assertion that the set of all sets does not exist within axiomatic set theory. The proof begins by assuming the existence of a universal set, denoted as $V$, which leads to the definition of a set $B = \{ x \in V: x \notin x \}$. This results in a contradiction, as it implies $B \in B \Leftrightarrow B \notin B$. Consequently, the initial assumption of the existence of $V$ is proven incorrect, affirming that the set of all sets cannot exist.

PREREQUISITES
  • Axiomatic set theory
  • Understanding of Russell's paradox
  • Basic set notation and operations
  • Logical reasoning and proof techniques
NEXT STEPS
  • Study the implications of Russell's paradox on set theory
  • Explore alternative set theories, such as Zermelo-Fraenkel set theory
  • Learn about the Axiom of Specification in detail
  • Investigate the concept of types in set theory and their relevance
USEFUL FOR

Mathematicians, logicians, philosophy students, and anyone interested in foundational issues in set theory and logic.

evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hey! (Wave)

Theorem (Russell's paradox is not a paradox in axiomatic set theory)

The set of all sets does not exist.

Proof

We suppose that the set of all sets exist, let $V$. So, for each set $x$, $x \in V$.
We define the type $\phi: \text{ a set does not belong to itself, so } x \notin x$.

So, from the Axiom schema of specification, the set $\{ x \in V: x \notin x \}$ exists.

Since $V$ is the set of all sets,

$$\{x \in V: x \notin x \} \subset V$$

So, $V'=\{ x: x \notin x \}$ is a set.

Therefore: $V' \in V' \leftrightarrow V' \notin V'$, contradiction.How do we know that $V'$ is a set? Also, could you explain me why, having found this contradiction, we have proven that the set of all sets do not exist? (Thinking)
 
Physics news on Phys.org
The proof starts with the assumption: suppose that the set of all sets exists. At the end the proof concludes that $V' \in V' \Leftrightarrow V' \notin V'$ which is a contradiction since a statement can not be equivalent with it's negation. Because of the contradiction the assumption (this is the only thing what was assumed) is incorrect hence the set of all sets does not exist.
 
We want to prove that the set of all sets do not exist.

We suppose that the set of all sets, let $V$, exists.
So, for each set $x, x \in V$.
We define the type $\phi: \text{ a set does not belong to itself , so } x \notin x$.

From the axiom schema of specification, we conclude that there is the set $B=\{ x \in V: x \notin x \}$

$$\forall y(y \in B) \Leftrightarrow y \notin y$$

How can we continue? (Thinking)
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
1
Views
1K
  • · Replies 132 ·
5
Replies
132
Views
20K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K