Timeline for Question about Godel's 2nd Theorem
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 18, 2011 at 1:20 | history | edited | Keshav Srinivasan | CC BY-SA 3.0 |
deleted 9 characters in body
|
| Oct 15, 2011 at 14:13 | comment | added | Keshav Srinivasan | Quinn, we are of course talking about recursively axiomatized theories, so yes T is "computable." | |
| Oct 14, 2011 at 13:18 | comment | added | Quinn Culver | Doesn't the statement "if T contains PA and T is (omega-) consistent, then T can neither prove Con(T) nor its negation." require that T be computable? | |
| Oct 14, 2011 at 4:04 | history | edited | Keshav Srinivasan | CC BY-SA 3.0 |
fixed a typo
|
| Oct 12, 2011 at 4:25 | history | edited | Keshav Srinivasan | CC BY-SA 3.0 |
fixed typo
|
| Oct 9, 2011 at 23:40 | answer | added | Andreas Blass | timeline score: 5 | |
| Oct 9, 2011 at 23:09 | answer | added | user5810 | timeline score: 3 | |
| Oct 9, 2011 at 22:34 | history | asked | Keshav Srinivasan | CC BY-SA 3.0 |