Timeline for What axioms are used to prove Gödel's Incompleteness Theorems?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 15 at 23:22 | history | edited | Timothy Chow | CC BY-SA 4.0 |
Fixed link
|
| Nov 27, 2023 at 21:01 | history | edited | David Roberts♦ | CC BY-SA 4.0 |
full bibliographic reference
|
| Apr 23, 2023 at 13:40 | comment | added | Timothy Chow | @CarlMummert It still works for me. There's also a Wayback Machine copy. | |
| Jun 26, 2020 at 12:44 | history | edited | Lawrence Paulson | CC BY-SA 4.0 |
added 101 characters in body
|
| Apr 24, 2019 at 13:20 | comment | added | Carl Mummert | The link in this answer no longer works. | |
| Dec 25, 2013 at 2:12 | comment | added | Todd Trimble | Thank you very much, @TimothyChow, for the clarification and information. | |
| Dec 25, 2013 at 1:51 | comment | added | Timothy Chow | This is not a non-answer. Świerczkowski shows that the proof of Gödel's theorem can be formalized in a set-theoretic system much weaker than ZFC, and this proof was the starting point for Lawrence Paulson's formalization of the theorem in Isabelle/HOL. See Paulson's paper, "A Machine-Assisted Proof of Gödel's Incompleteness Theorems for the Theory of Hereditarily Finite Sets," which he seems to be too modest to mention himself. | |
| Dec 24, 2013 at 23:26 | comment | added | Todd Trimble | Several users consider this as a non-answer to the actual question. | |
| Dec 24, 2013 at 19:58 | history | edited | Lawrence Paulson | CC BY-SA 3.0 |
deleted 2 characters in body
|
| Dec 24, 2013 at 19:04 | review | Late answers | |||
| Dec 24, 2013 at 19:08 | |||||
| Dec 24, 2013 at 18:45 | history | answered | Lawrence Paulson | CC BY-SA 3.0 |