On incompleteness
Any consistent formal system strong enough to describe arithmetic contains true statements it cannot prove.
The second theorem shows such a system cannot demonstrate its own consistency.
Any consistent formal system strong enough to describe arithmetic contains true statements it cannot prove.
The second theorem shows such a system cannot demonstrate its own consistency.
| Title | Year | Pages |
|---|---|---|
| First edition | 1931 | 26 |
| Annotated | 1992 | 142 |