Timeline for complexity of proof of p(n) grows greater with n if for all x P(x) is unprovable?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29, 2014 at 13:45 | comment | added | Emil Jeřábek | Here is also a survey article: link.springer.com/article/10.1007%2Fs10958-009-9408-0 | |
| Sep 29, 2014 at 13:33 | comment | added | Anders Göransson | Thank you, I heard something along these lines (which I tried to formulate), a while ago from a logician and now I believe that what you write above must be what he had in mind. I will look at the paper. | |
| Sep 29, 2014 at 13:26 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
added 180 characters in body
|
| Sep 29, 2014 at 13:18 | history | answered | Emil Jeřábek | CC BY-SA 3.0 |