Timeline for Ways to define "definability"
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 2, 2013 at 23:18 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
expand
|
| Nov 2, 2013 at 21:52 | history | edited | Hans-Peter Stricker | CC BY-SA 3.0 |
"to to" -> "to do"
|
| Nov 2, 2013 at 18:43 | comment | added | Hans-Peter Stricker | @Emil: You are right, that's what I was asking for. | |
| Nov 2, 2013 at 18:42 | comment | added | Emil Jeřábek | Judging from your recent comments, it would seem that you and me interpret question 3 in a different way. My reading is that Hans is asking for restrictions on formulas that ensure a definable notion of definability without requiring parameters to be ordinals. | |
| Nov 2, 2013 at 18:37 | comment | added | Joel David Hamkins | And indeed, when $k\geq 2$, then the ordinal definable $\Sigma_k$ sets agree with the OD sets. | |
| Nov 2, 2013 at 18:31 | comment | added | Emil Jeřábek | I observe that en.wikipedia.org/wiki/L%C3%A9vy_hierarchy is in dire need of fixing. | |
| Nov 2, 2013 at 18:29 | history | answered | Emil Jeřábek | CC BY-SA 3.0 |