completeness

#concept

a formal system is complete if >> for every statement of the language of the system, either the statement or its negation can be derived (.i.e. proved) in the system.

References §

1. https://plato.stanford.edu/entries/goedel-incompleteness/#:~:text=A%20formal%20system%20is%20complete%20if%20for%20every%20statement%20of%20the%20language%20of%20the%20system%2C%20either%20the%20statement%20or%20its%20negation%20can%20be%20derived%20(i.e.%2C%20proved)%20in%20the%20system.

Notes §