Constructible Sets Are Definable From The Ordinals
There is a formula of set theory which expresses the idea that X=Lα. It has only free variables for X and α. Using this we can expand the definition of each constructible set. If s∈Lα+1, then s = {y|y∈Lα and Φ(y,z1,...,zn) holds in (Lα,∈)} for some formula Φ and some z1,...,zn in Lα. This is equivalent to saying that: for all y, y∈s if and only if where Ψ(X,...) is the result of restricting each quantifier in Φ(...) to X. Notice that each zk∈Lβ+1 for some β<α. Combine formulas for the z's with the formula for s and apply existential quantifiers over the z's outside and one gets a formula which defines the constructible set s using only the ordinals α which appear in expressions like X=Lα as parameters.
Example: The set {5,ω} is constructible. It is the unique set, s, which satisfies the formula:
,
where is short for:
Actually, even this complex formula has been simplified from what the instructions given in the first paragraph would yield. But the point remains, there is a formula of set theory which is true only for the desired constructible set s and which contains parameters only for ordinals.
Read more about this topic: Constructible Universe
Famous quotes containing the word sets:
“There be some sports are painful, and their labor
Delight in them sets off. Some kinds of baseness
Are nobly undergone, and most poor matters
Point to rich ends.”
—William Shakespeare (15641616)