Constructible hierarchy: Difference between revisions

Line 2:
 
== Definition ==
Say a subset \(X\) of \(Y\) is definable if there are some \(z_0, z_1, \cdots, z_n \in Y\) and some formula \(\varphi\) in the language of set theory so that the elements of \(X\) are precisely the \(x\) so that \(Y\) satisfies \(\varphi(x, z_0, z_1, \cdots, z_n)\). For example, under the von Neumann definition of ordinal, the set of even numbers, the set of odd numbers, the set of prime numbers, the set of perfect squares greater than 17, and so on, are all definable. Using elementary cardinal arithmetic, youthere can note that thereare \(\max(\aleph_0, |Y|) = |Y|\) definable subsets of an infinite set \(Y\), and thus "almost all" subsets of an infinite set are not definable. The parameters \(\vec{z}\) aren'tare of importance inwhen the\(Y\) contextis ofuncountable, definableto subsetsensure ofthat thethere naturalare numbers,more sincethan all\(\aleph_0\) elementsdefinable subsets of the\(Y\), naturalbut numbersthey aredo definable,not buthave theyany willeffect be ifwhen \(Y\supseteq\mathbb N\) is uncountablecountable, becausesince noall uncountableelements beof pointwisethe definable,natural andnumbers ensure that there aren't just always \(\aleph_0\)are definable subsets of a set.
 
Like with the von Neumann hierarchy, the constructible hierarchy is built up in stages, denoted \(L_\alpha\).<ref>K. J. Devlin, "[https://core.ac.uk/download/pdf/30905237.pdf An introduction to the fine structure of the constructible hierarchy]" (1974)</ref>
160

edits