A hierarchy of hereditarily finite sets
- 46 Downloads
This article defines a hierarchy on the hereditarily finite sets which reflects the way sets are built up from the empty set by repeated adjunction, the addition to an already existing set of a single new element drawn from the already existing sets. The structure of the lowest levels of this hierarchy is examined, and some results are obtained about the cardinalities of levels of the hierarchy.
KeywordsFinite set theory Adjunction Adduction Hierarchy
Mathematics Subject Classification (2000)03E20
Unable to display preview. Download preview PDF.
- 1.Givant S., Tarski A.: Peano arithmetic and the Zermelo-like theory of sets with finite ranks. Not. Am. Math. Soc. 77T-E51, A-437 (1977)Google Scholar
- 3.Kirby, L.: Finitary set theory. Notre Dame J. Formal Log. (to appear)Google Scholar
- 8.Tarski A.: Sur les ensembles finis. Fundam. Math. 6, 45–95 (1924)Google Scholar