Timeline for Do we expect that sufficiently large computable ordinals settle every question of arithmetic?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 15, 2022 at 19:03 | history | edited | Dmytro Taranovsky | CC BY-SA 4.0 |
revise the philosophy/expectations text
|
| Oct 15, 2022 at 7:43 | history | edited | Dmytro Taranovsky | CC BY-SA 4.0 |
fix/clarify the incompressibility claim
|
| S Oct 15, 2022 at 6:23 | history | edited | Dmytro Taranovsky | CC BY-SA 4.0 |
some math notation copy-editing (based on suggested edit)
|
| S Oct 15, 2022 at 6:23 | history | suggested | CommunityBot | CC BY-SA 4.0 |
some math notation copy-editing
|
| Oct 15, 2022 at 6:01 | review | Suggested edits | |||
| S Oct 15, 2022 at 6:23 | |||||
| Oct 15, 2022 at 5:26 | history | edited | Dmytro Taranovsky | CC BY-SA 4.0 |
more details on strong statements from small ordinals
|
| Oct 15, 2022 at 2:36 | history | edited | Dmytro Taranovsky | CC BY-SA 4.0 |
a few more details
|
| Oct 15, 2022 at 1:38 | history | edited | Dmytro Taranovsky | CC BY-SA 4.0 |
added 74 characters in body
|
| Oct 15, 2022 at 1:31 | history | answered | Dmytro Taranovsky | CC BY-SA 4.0 |