Timeline for How to kill a $\Sigma_{n+1}$-correct cardinal softly ($n>1$)?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 6, 2018 at 18:18 | vote | accept | Jinglun Cai | ||
| Mar 4, 2018 at 14:36 | comment | added | Joel David Hamkins | Since this argument is a bit finicky, I wonder whether one might try something simpler. For example, suppose we just code the $\Sigma_2$-correct cardinals into the GCH pattern? Does this make $\Sigma_{n+1}$-correctness into mere $\Sigma_n$ correctness for all larger $n$? My idea is to drop down the complexity from the bottom, rather than from the top. | |
| Mar 4, 2018 at 14:17 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |