Timeline for Finite versions of Godel' s incompleteness
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 29, 2012 at 18:52 | history | edited | abo | CC BY-SA 3.0 |
Clarification
|
| Jun 29, 2012 at 5:42 | comment | added | abo | Actually on reflection this answer is not correct, as it stands. It seems to me to depend on the definition of complexity you are using and the number k. For instance, if your definition is such that the only way to refer to k is with a complexity of k or greater, then it will not be possible to prove the k-consistency of the theory, because it is not even possible to refer to k in any proof of complexity k. | |
| Jun 29, 2012 at 5:24 | history | answered | abo | CC BY-SA 3.0 |