Skip to main content
improved formatting and fixed two typos
Source Link
Davide Giraudo
  • 4k
  • 2
  • 30
  • 42

The order is very easy. Under $V=L$, the set-theoretic universe is built according the hierarchy $(L_alpha \mid \alpha \in \mathrm{Ord})$$(L_\alpha \mid \alpha \in \mathrm{Ord})$, where $L_0$ is empty, $L_{\alpha+1}$ consists of all definable subsets of $L_\alpha$, and $L_\lambda$ is the union of all earlier $L_\alpha$ when $\lambda$ is a limit ordinal.

Since we can order the definitions used to go from $L_\alpha$ to $L_{\alpha+1}$, we obtain a definable well-ordering of the entire universe. Namely, $x$ is less than $y$ iff

  1. $x$ appears before $y$ in the hierarchy or
  2. they appear at the same stage, but $x$ appears with an earlier definition than $y$.

If one analyzes the complexity of the resulting definition for real numbers, it has complexity $\Delta^1_2$ in the descriptive set theoretic hierarchy.

The order is very easy. Under $V=L$, the set-theoretic universe is built according the hierarchy $(L_alpha \mid \alpha \in \mathrm{Ord})$, where $L_0$ is empty, $L_{\alpha+1}$ consists of all definable subsets of $L_\alpha$, and $L_\lambda$ is the union of all earlier $L_\alpha$ when $\lambda$ is a limit ordinal.

Since we can order the definitions used to go from $L_\alpha$ to $L_{\alpha+1}$, we obtain a definable well-ordering of the entire universe. Namely, $x$ is less than $y$ iff

  1. $x$ appears before $y$ in the hierarchy or
  2. they appear at the same stage, but $x$ appears with an earlier definition than $y$.

If one analyzes the complexity of the resulting definition for real numbers, it has complexity $\Delta^1_2$ in the descriptive set theoretic hierarchy.

The order is very easy. Under $V=L$, the set-theoretic universe is built according the hierarchy $(L_\alpha \mid \alpha \in \mathrm{Ord})$, where $L_0$ is empty, $L_{\alpha+1}$ consists of all definable subsets of $L_\alpha$, and $L_\lambda$ is the union of all earlier $L_\alpha$ when $\lambda$ is a limit ordinal.

Since we can order the definitions used to go from $L_\alpha$ to $L_{\alpha+1}$, we obtain a definable well-ordering of the entire universe. Namely, $x$ is less than $y$ iff

  1. $x$ appears before $y$ in the hierarchy or
  2. they appear at the same stage, but $x$ appears with an earlier definition than $y$.

If one analyzes the complexity of the resulting definition for real numbers, it has complexity $\Delta^1_2$ in the descriptive set theoretic hierarchy.

The order is very easy. Under V=L$V=L$, the set-theoretic universe is built according the hierarhcy L_alphahierarchy $(L_alpha \mid \alpha \in \mathrm{Ord})$, where L_0$L_0$ is empty, L_{alpha+1}$L_{\alpha+1}$ consists of all definable subsets of L_alpha$L_\alpha$, and L_lambda$L_\lambda$ is the union of all earlier L_alpha$L_\alpha$ when lambda$\lambda$ is a limit ordinal.

Since we can order the definitions used to go from L_alpha$L_\alpha$ to L_{alpha+1}$L_{\alpha+1}$, we obtain a definable well-ordering of the entire universe. Namely, x$x$ is less than y iff (1) x appears before y in the hiearchy or (2) they appear at the same stage, but x appears with an earlier definition than y.$y$ iff

  1. $x$ appears before $y$ in the hierarchy or
  2. they appear at the same stage, but $x$ appears with an earlier definition than $y$.

If one analyzes the complexity of the resulting definition for real numbers, it has complexity Delta^1_2$\Delta^1_2$ in the descriptive set theoretic hierarchy.

The order is very easy. Under V=L, the set-theoretic universe is built according the hierarhcy L_alpha, where L_0 is empty, L_{alpha+1} consists of all definable subsets of L_alpha, and L_lambda is the union of all earlier L_alpha when lambda is a limit ordinal.

Since we can order the definitions used to go from L_alpha to L_{alpha+1}, we obtain a definable well-ordering of the entire universe. Namely, x is less than y iff (1) x appears before y in the hiearchy or (2) they appear at the same stage, but x appears with an earlier definition than y.

If one analyzes the complexity of the resulting definition for real numbers, it has complexity Delta^1_2 in the descriptive set theoretic hierarchy.

The order is very easy. Under $V=L$, the set-theoretic universe is built according the hierarchy $(L_alpha \mid \alpha \in \mathrm{Ord})$, where $L_0$ is empty, $L_{\alpha+1}$ consists of all definable subsets of $L_\alpha$, and $L_\lambda$ is the union of all earlier $L_\alpha$ when $\lambda$ is a limit ordinal.

Since we can order the definitions used to go from $L_\alpha$ to $L_{\alpha+1}$, we obtain a definable well-ordering of the entire universe. Namely, $x$ is less than $y$ iff

  1. $x$ appears before $y$ in the hierarchy or
  2. they appear at the same stage, but $x$ appears with an earlier definition than $y$.

If one analyzes the complexity of the resulting definition for real numbers, it has complexity $\Delta^1_2$ in the descriptive set theoretic hierarchy.

Source Link
Joel David Hamkins
  • 236.3k
  • 44
  • 777
  • 1.4k

The order is very easy. Under V=L, the set-theoretic universe is built according the hierarhcy L_alpha, where L_0 is empty, L_{alpha+1} consists of all definable subsets of L_alpha, and L_lambda is the union of all earlier L_alpha when lambda is a limit ordinal.

Since we can order the definitions used to go from L_alpha to L_{alpha+1}, we obtain a definable well-ordering of the entire universe. Namely, x is less than y iff (1) x appears before y in the hiearchy or (2) they appear at the same stage, but x appears with an earlier definition than y.

If one analyzes the complexity of the resulting definition for real numbers, it has complexity Delta^1_2 in the descriptive set theoretic hierarchy.