Incompleteness and undecidability


In Episode 1, we introduced the very idea of a negation-incomplete formalized theory T . We noted that if we aim to construct a theory of basic arithmetic, we’ll ideally like the theory to be able to prove all the truths expressible in the language of basic arithmetic, and hence to be negation complete. But Gödel’s First Incompleteness Theorem says, very roughly, that a nice theory T containing enough arithmetic will always be negation incomplete. Now, the Theorem comes in two flavours, depending on whether we cash out the idea of being ‘nice enough’ in terms of (i) the semantic idea of T ’s being a sound theory, or (ii) the idea of odel’s own T ’s being a consistent theory which proves enough arithmetic. And we noted that G¨.



    Upload a copy of this work     Papers currently archived: 93,069

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.


Added to PP

20 (#792,731)

6 months
1 (#1,516,021)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Peter Eldridge-Smith
Australian National University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references