Timeline for Godel 's Ladder: Undecidable PI_N sentences for N =2, 3, ......
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30, 2012 at 14:36 | comment | added | Ali Enayat | Joel, you are right, my concern is with the wording of David's answer. | |
| Jun 28, 2012 at 9:32 | comment | added | Joel David Hamkins | But Ali, those two notions are deeply connected: every strictly $\Pi^0_n$ set $A$, for nonzero $n$, has infinitely many $k$ for which the assertion $k\in A$ is independent of your favorite theory, for otherwise the proof-search algorithm would show that $A$ is not actually $\Pi^0_n$. | |
| Jun 28, 2012 at 1:30 | comment | added | Ali Enayat | David, how exactly does the set you describe provide "such a sentence"? It seems to me that your solution is conflating two meanings of the word "undecidable": one meaning applies to a set of integers, the other to a sentence. | |
| Jun 23, 2012 at 17:21 | vote | accept | Mirco A. Mannucci | ||
| Jun 23, 2012 at 13:36 | history | answered | David Harris | CC BY-SA 3.0 |