To be complete such a system must be able to prove that any formula expressible in its language (a mathematical equation, for example, or a statement in symbolic logic) is either true or false; nothing can be undecidable.