Godel's incompleteness theorem

Home > Languages > Formal Language > Recursively Enumerable Languages > Godel's incompleteness theorem

The incompleteness theorem states that any formal system that is powerful enough to express arithmetic will be either inconsistent or incomplete.