Syntactic Completeness

A property of a deductive system or theory asserting that for every sentence φ in the language either φ is provable from the system (or theory) or its negation ¬φ is provable; equivalently, the theory is maximally consistent with respect to sentences of the language.