A question about intersection of system of sets

Click For Summary
SUMMARY

The discussion centers on the intersection of sets in set theory, specifically addressing the expression \bigcap \emptyset. Participants clarify that in Zermelo-Fraenkel (ZF) set theory, \bigcap \emptyset is undefined, as the set of all sets does not exist. They emphasize that vacuous truth implies that for any x, the statement x ∈ A for A in the empty set is true, leading to the conclusion that \bigcap \emptyset cannot be defined as an actual set. References to authoritative texts such as "Introduction to Set Theory" by Hrbacek and Jech and "Set Theory" by Jech support these claims.

PREREQUISITES
  • Understanding of basic set theory concepts, including intersections and empty sets.
  • Familiarity with Zermelo-Fraenkel (ZF) axioms and their implications.
  • Knowledge of vacuous truth in logical statements.
  • Basic understanding of formal logic notation and set-builder notation.
NEXT STEPS
  • Study the Zermelo-Fraenkel (ZF) axioms in detail.
  • Learn about vacuous truth and its applications in logic.
  • Explore set-builder notation and its limitations in ZF set theory.
  • Read "Introduction to Set Theory" by Hrbacek and Jech for foundational concepts and exercises.
USEFUL FOR

Students and enthusiasts of mathematics, particularly those studying set theory, logic, and foundational mathematics, will benefit from this discussion.

  • #31
xxxx0xxxx said:
I disagree on the following point.

I overlooked that you are referring to: y∈{x | φ(x)} ↔ φ(y) as though it is a definition, when it is actually not.

y∈{x | φ(x)} ↔ φ(y) is a theorem of naive set theory that restates the axiom of abstraction using the {...|...} operator.

In ZF, this theorem admits Russell's paradox, and cannot be a theorem of ZF.

The correct theorem in ZF is:

y \in \{x | \phi (x) \} \Rightarrow \phi (y)

The equivalence cannot be justified from the separation axiom, and must be an implication to avoid the paradox.

And as you may probably have already guessed, and operation definition for {x | φ(x)} is required in order to eliminate {x | φ(x)} entirely to wff's in the object language:

\{x | \phi (x) \} = w \Leftrightarrow [ \forall x (x \in w \Leftrightarrow \phi (x)) \wedge w \mbox{ is a set} ] \vee [\neg \exists B \forall x (x \in B \Leftrightarrow \phi (x)) \wedge w = \emptyset]

This definition along with

\{ x | \phi (x) \} \not = \emptyset

proves the implication, but the converse


\phi (y) \Rightarrow y \in \{x | \phi (x) \}

cannot be shown to follow from separation.

Yes, I understand you completely. But I think you fail to understand me. You're taking the point-of-view of Suppes. This is not standard terminology!
Please, read another book on set theory and you will see what I'm talking about.

I can make suggestion to you that will increase your understanding and point-of-views. But only you can follow them :smile:

Good luck on your research!
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 4 ·
Replies
4
Views
808
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 33 ·
2
Replies
33
Views
4K
  • · Replies 25 ·
Replies
25
Views
4K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K