Goedelís Theorem

• True of formal systems strong enough to include arithmetic

• Completeness, Consistency

• Goedel-numbering

• ìThere is no number such that it is the Goedel number of the proof of the statement with Goedel number Xî [X]

• (ìI am not provable.î)

Previous slide

Next slide

Back to first slide

View graphic version