Timeline for Can one say that there are equal numbers of sets satisfying formulas in Second Order Arithmetic?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 11 at 23:06 | history | became hot network question | |||
| Dec 11 at 19:29 | vote | accept | Alexander Pruss | ||
| Dec 11 at 17:59 | answer | added | Joel David Hamkins | timeline score: 3 | |
| Dec 11 at 17:25 | history | edited | Alexander Pruss | CC BY-SA 4.0 |
Removed parenthetical note as it wasn't correct: expressibility of uncountability over MSO(N,<) does not obviously imply expressibility of uncountability over SOA, as the latter has more formulas.
|
| Dec 11 at 16:16 | history | edited | Alexander Pruss | CC BY-SA 4.0 |
added 335 characters in body
|
| Dec 11 at 14:58 | history | edited | LSpice | CC BY-SA 4.0 |
Name of "here"
|
| Dec 11 at 14:57 | history | edited | Alexander Pruss | CC BY-SA 4.0 |
added 29 characters in body
|
| Dec 11 at 14:51 | history | asked | Alexander Pruss | CC BY-SA 4.0 |