World Library  
Flag as Inappropriate
Email this Article

Hereditarily finite set

Article Id: WHEBN0000332621
Reproduction Date:

Title: Hereditarily finite set  
Author: World Heritage Encyclopedia
Language: English
Subject: Set theory, Axiom of regularity, Axiom of infinity, Axiom of pairing, General set theory
Collection: Set Theory
Publisher: World Heritage Encyclopedia

Hereditarily finite set

~V_4~ represented with circles in place of curly brackets    

In mathematics and set theory, hereditarily finite sets are defined as finite sets whose elements are all hereditarily finite sets.


  • Formal definition 1
  • Discussion 2
  • Ackermann's bijection 3
  • Rado graph 4
  • See also 5
  • References 6

Formal definition

A recursive definition of well-founded hereditarily finite sets goes as follows:

Base case: The empty set is a hereditarily finite set.
Recursion rule: If a1,...,ak are hereditarily finite, then so is {a1,...,ak}.

The set of all well-founded hereditarily finite sets is denoted Vω. If we denote P(S) for the power set of S, Vω can also be constructed by first taking the empty set written V0, then V1 = P(V0), V2 = P(V1),..., Vk = P(Vk−1),... Then

\bigcup_{k=0}^\infty V_k = V_\omega.


The hereditarily finite sets are a subclass of the Von Neumann universe. They are a model of the axioms consisting of the axioms of set theory with the axiom of infinity replaced by its negation, thus proving that the axiom of infinity is not a consequence of the other axioms of set theory.

Notice that there are countably many hereditarily finite sets, since Vn is finite for any finite n (its cardinality is n−12, see tetration), and the union of countably many finite sets is countable.

Equivalently, a set is hereditarily finite if and only if its transitive closure is finite. Vω is also symbolized by H_{\aleph_0}, meaning hereditarily of cardinality less than \aleph_0.

Ackermann's bijection

Ackermann (1937) gave the following natural bijection f from the natural numbers to the hereditarily finite sets, known as the Ackermann coding. It is defined recursively by

f(2^a+2^b+\cdots) = \{f(a), f(b),\ldots\} if a, b, ... are distinct.

We have f(m)∈f(n) if and only if the mth binary digit of n (counting from the right starting at 0) is 1.

Rado graph

The graph whose vertices are the hereditarily finite sets, with an edge joining two vertices whenever one is contained in the other, is the Rado graph or random graph.

See also


  • Ackermann, Wilhelm (1937), "Die Widerspruchsfreiheit der allgemeinen Mengenlehre", Mathematische Annalen 114 (1): 305–315,  
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from World eBook Library are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.