Timeline for Can we find strong fixed-points in the fixed-point lemma of Gödel's incompleteness theorem, that is, where the fixed point is syntactically identical to its substitution instance rather than merely provably equivalent to it?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:57 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Apr 11, 2012 at 1:43 | answer | added | Ali Enayat | timeline score: 22 | |
| Dec 21, 2011 at 22:36 | comment | added | Joel David Hamkins | Russell, yes, a term contains no relation symbol. Terms in the ordinary language of arithmetic are essentially just polynomial expressions. | |
| Dec 21, 2011 at 21:29 | comment | added | Russell O'Connor | Am I right in noting that the symbol < is useless since no term can contain it? | |
| Dec 11, 2011 at 16:44 | comment | added | Joel David Hamkins | Quinn, sorry, the server seems to be momentarily down. The link is correct, so try again later. Meanwhile, I'll look into it. | |
| Dec 11, 2011 at 16:23 | comment | added | Quinn Culver | Your first link (to Graham Priest's talk) is not working (for me). | |
| Dec 11, 2011 at 2:47 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
Added reference to speaker; edited body
|
| Dec 11, 2011 at 1:41 | history | asked | Joel David Hamkins | CC BY-SA 3.0 |