Hereditarily countable set
This article needs more citations. (March 2024) |
In set theory, a set is called hereditarily countable if it is a countable set of hereditarily countable sets.
Results
[edit]The inductive definition above is well-founded and can be expressed in the language of first-order set theory.
Equivalent properties
[edit]A set is hereditarily countable if and only if it is countable, and every element of its transitive closure is countable.[1]
The collection of all hereditarily countable sets
[edit]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 . In particular, the existence does not require any form of the axiom of choice. Constructive Zermelo–Fraenkel (CZF) does not prove the class to be a set.
The set is included in the set from the von Neumann hierarchy, that is, . Every hereditarily finite set is hereditarily countable, so . Since is countable, we in fact have .
An ordinal is hereditarily countable if and only if it is countable.
Model theory
[edit]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 , then .
Generalizations
[edit]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 . 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
[edit]References
[edit]