User Tools

Site Tools


goedels_incompleteness_theorems

Gödel's first incompleteness theorem, perhaps the single most celebrated result in mathematical logic, states that:

For any consistent formal, computably enumerable theory that proves basic arithmetical truths, an arithmetical statement that is true, but not provable in the theory, can be constructed. That is, any effectively generated theory capable of expressing elementary arithmetic cannot be both consistent and complete.

Gödel's second incompleteness theorem can be stated as follows:

For any formal recursively enumerable (i.e. effectively generated) theory T including basic arithmetical truths and also certain truths about formal provability, T includes a statement of its own consistency if and only if T is inconsistent.

http://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems

goedels_incompleteness_theorems.txt · Last modified: 2007/10/19 16:21 by 192.168.1.34