Information AboutComplete |
| CATEGORIES ABOUT COMPLETENESS | |
| mathematical terminology | |
| logic | |
eg S for every Sentence in the Language . A system is ''consistent'' if a proof never exists for both ''P'' and not ''P''. Gödel's Incompleteness Theorem says that no system as powerful as the Peano Axioms can be both consistent and complete. See also below for another notion of completeness in logic. |
|
|