 #jsDisabledContent { display:none; } My Account |  Register |  Help Flag as Inappropriate This article will be permanently flagged as inappropriate and made unaccessible to everyone. Are you certain this article is inappropriate?          Excessive Violence          Sexual Content          Political / Social Email this Article Email Address:

# Hereditarily finite set

Article Id: WHEBN0000332621
Reproduction Date:

 Title: Hereditarily finite set Author: World Heritage Encyclopedia Language: English Subject: Collection: Set Theory Publisher: World Heritage Encyclopedia Publication Date:

### Hereditarily finite set

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

## Contents

• Formal definition 1
• Discussion 2
• Ackermann's bijection 3
• 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.

## Discussion

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.