Timeline for Is there a first-order theory who does not interpret arithmetic yet still does not have a computable consistent completion?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 17, 2019 at 10:05 | comment | added | Wlod AA | Godel's theorem was proved several years earlier by Emil Leon Post. The proofs were not identical. Just in case, one could learn the Post's proof. | |
| Aug 16, 2019 at 13:23 | answer | added | user44143 | timeline score: 6 | |
| Sep 8, 2017 at 17:46 | vote | accept | Ruizhi Yang | ||
| Sep 8, 2017 at 17:38 | comment | added | Wojowu | What do you mean by "arithmetic" here? PA, Robinson's Q,...? | |
| Sep 8, 2017 at 17:37 | answer | added | Emil Jeřábek | timeline score: 24 | |
| Sep 8, 2017 at 17:22 | history | asked | Ruizhi Yang | CC BY-SA 3.0 |