Timeline for Can the incompleteness of set theory be isolated to questions about arithmetic?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| 2 hours ago | vote | accept | zeb | ||
| 5 hours ago | history | became hot network question | |||
| 7 hours ago | comment | added | Mikhail Katz | Another question would be whether there are purely arithmetic statements that are "convincingly incomplete" in the sense that they don't have a preferred truth value. For example, CON(PA) is not convincingly incomplete because it should "obviously" be true. Paris-Harrington is not convincingly incomplete for a similar reason, etc. (Obviously, CH is not a "purely arithmetic" statement.) | |
| 8 hours ago | answer | added | Emil Jeřábek | timeline score: 7 | |
| 13 hours ago | answer | added | Noah Schweber | timeline score: 9 | |
| 13 hours ago | history | asked | zeb | CC BY-SA 4.0 |