A (logical) language is said to be complete if and only if all the formulas in the language that must be true (in any world in which the axioms of the language are true) can be proved from the axioms. Godel's incompleteness theorem shows that any language in which the truths of basic arithmetic can be formulated cannot be complete (unless the number of axioms is infinite).