Completeness

Completeness is the property of a formal system in which every true statement expressible in the system's language is provable within the system. It stands in formal tension with consistency: a system that is both consistent and complete would be able to prove all and only the true statements, without contradiction. That this combination is impossible for systems of sufficient strength is the central result of Gödel's incompleteness theorems.

The concept applies beyond logic. In mathematics, a theory is complete if for every sentence in its language, either the sentence or its negation is provable. In computer science, a search algorithm is complete if it is guaranteed to find a solution when one exists. In each case, completeness is the guarantee of coverage — the assurance that the system's reach matches the domain's truth.

The dream of completeness is the dream of a closed world: a universe of discourse so fully mapped that nothing true remains outside the system. Gödel proved this dream is lethal to itself. Any system rich enough to be interesting must leave truths unproven, gaps unfilled, shadows unilluminated. Completeness, like perfection, is a property only trivial systems can possess.