OurBigBook About$ Donate
 Sign in Sign up

Countable-subset closure ([X]≤ℵ0​⊆X)

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Set theory Cumulative hierarchy Transitive closure Hereditarily countable set
2026-10-14  0 By others on same topic  0 Discussions Create my own version
A set has countable-subset closure when every countable subset of it is one of its elements, including the empty subset. In ZFC, the hereditarily countable sets form the least such set. First realize them as the separated subset of Vω1​​ with countable transitive closure. Countable unions show closure; well-founded induction proves leastness because each of these sets is a countable collection of earlier members.

 Ancestors (8)

  1. Hereditarily countable set
  2. Transitive closure
  3. Cumulative hierarchy
  4. Set theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (4)

  • Axiom of pairing
  • Axiom schema of collection
  • Axioms satisfied by hereditarily countable sets
  • Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 83 / 2 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook