 tags
 Logic
 resources

Stanford encyclopedia of Philosophy
First incompleteness theorem Any consistent formal system F within which a certain amount of elementary arithmetic can be carried out is incomplete; i.e., there are statements of the language of F which can neither be proved nor disproved in F.
Panu Raatikainen
This theorem was followed by several closely related theorems, such as Turing’s Halting problem