OurBigBook About$ Donate
 Sign in Sign up

Axioms satisfied by hereditarily countable sets (HC⊨ZFC−PowerSet)

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
The transitive set of hereditarily countable sets satisfies every ZFC axiom except the Axiom of power set. For internal definable functions on a countable domain, ambient Axiom schema of replacement gives a countable range of hereditarily countable sets, which belongs to the structure by countable-subset closure. The same closure proves axiom schema of collection and retains countable choice-function graphs. All subsets of ω are elements, but their uncountable full power set is not an element, so Power Set fails.

 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 (2)

  • Past exam of the mathematics course of the University of Cambridge / 2009 / ii / Paper 4 / 16G / Solution
  • 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