Timeline for Models of second-order arithmetic closed under relative constructibility
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5 at 4:27 | comment | added | François G. Dorais | Send me an email request: [email protected] (no cedilla). | |
| Feb 4 at 19:15 | comment | added | Noah Schweber | @FrançoisG.Dorais Ditto Hanul's comment! | |
| Feb 4 at 19:11 | comment | added | Hanul Jeon | @FrançoisG.Dorais May I get your unpublished proof? It looks interesting. | |
| Feb 4 at 18:58 | comment | added | François G. Dorais | Mathias calls a set "provident" if it is closed under height-bounded relative constructibility (+ infinity + basic combinatorics). I've shown a while ago (unpublished) that the second-order part of such sets are exactly $\omega$-models of $\mathsf{ACA}_0^+$. | |
| Feb 4 at 18:47 | history | answered | Noah Schweber | CC BY-SA 4.0 |