Timeline for Is there a concrete statement unprovably true in ZFC? [duplicate]
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 22, 2017 at 19:53 | comment | added | Asaf Karagila♦ | Something worth remembering is that "true" is meaningless without a proper context. In set theory, unlike arithmetic, there is no canonical model whose theory we take as "true". | |
| Oct 22, 2017 at 16:10 | comment | added | Terry Tao | Your intuition is correct (assuming, of course, that true arithmetic exists and is a model of the formal system of arithmetic one is using to form proofs, though an unprovable statement will necessarily also be false in some other, more exotic, nonstandard models of arithmetic). See the answers to mathoverflow.net/questions/27755/… | |
| Oct 22, 2017 at 15:12 | history | closed |
Lwins CommunityBot |
Duplicate of Unprovable sentence about integers | |
| Oct 22, 2017 at 15:11 | comment | added | Lwins | I have found that the post mathoverflow.net/q/76897/22954 is useful for my question. So I would like to close this question. | |
| Oct 22, 2017 at 15:01 | comment | added | Wojowu | Check out Godel's incompleteness theorems. If ZFC is consistent, "ZFC is consistent" is a statement of the sort you want. | |
| Oct 22, 2017 at 14:56 | history | asked | Lwins | CC BY-SA 3.0 |