Formal Definition
A recursive definition of a hereditarily finite set 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 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
Read more about this topic: Hereditarily Finite Set
Famous quotes containing the words formal and/or definition:
“On every formal visit a child ought to be of the party, by way of provision for discourse.”
—Jane Austen (1775–1817)
“The man who knows governments most completely is he who troubles himself least about a definition which shall give their essence. Enjoying an intimate acquaintance with all their particularities in turn, he would naturally regard an abstract conception in which these were unified as a thing more misleading than enlightening.”
—William James (1842–1910)