In
mathematics, a
formal system[?] is said to be
consistent if none of its proven
theorems can also be disproven within that system. Or, alternatively, if the formal system does not assign both true and false as the semantics of one given statement.
To add:
- systems proved to be consistent
- systems not proved consistent
- systems that cannot be proved consistent
See also:
All Wikipedia text
is available under the
terms of the GNU Free Documentation License