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:
“The manifestation of poetry in external life is formal perfection. True sentiment grows within, and art must represent internal phenomena externally.”
—Franz Grillparzer (1791–1872)
“No man, not even a doctor, ever gives any other definition of what a nurse should be than this—”devoted and obedient.” This definition would do just as well for a porter. It might even do for a horse. It would not do for a policeman.”
—Florence Nightingale (1820–1910)