Hereditarily countable set
In set theory, a set is called hereditarily countable if it is a countable set of hereditarily countable sets.
Results
The inductive definition above is well-founded and can be expressed in the language of first-order set theory.
Equivalent properties
A set is hereditarily countable if and only if it is countable, and every element of its transitive closure is countable. If the axiom of countable choice holds, then a set is hereditarily countable if and only if its transitive closure is countable.
The collection of all h. c. sets
The class of all hereditarily countable sets can be proven to be a set from the axioms of Zermelo–Fraenkel set theory (ZF) and is set is designated [math]\displaystyle{ H_{\aleph_1} }[/math]. In particular, the existence does not require any form of the axiom of choice. Constructive Zermelo-Freankel (CZF) does not prove the class to be a set.
Model theory
This class is a model of Kripke–Platek set theory with the axiom of infinity (KPI), if the axiom of countable choice is assumed in the metatheory.
If [math]\displaystyle{ x \in H_{\aleph_1} }[/math], then [math]\displaystyle{ L_{\omega_1}(x) \subset H_{\aleph_1} }[/math].
Generalizations
More generally, a set is hereditarily of cardinality less than κ if it is of cardinality less than κ, and all its elements are hereditarily of cardinality less than κ; the class of all such sets can also be proven to be a set from the axioms of ZF, and is designated [math]\displaystyle{ H_\kappa \! }[/math]. If the axiom of choice holds and the cardinal κ is regular, then a set is hereditarily of cardinality less than κ if and only if its transitive closure is of cardinality less than κ.
See also
- Hereditarily finite set
- Constructible universe
External links
 |  |
