Encyclopedia > Consistency

  Article Content

Consistency

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

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Grateful Dead

... based on two-track mixes made at the time of the recording. There have been at least 28 DP releases as of April 2003. Then a series of videos began to trickle out of "The ...

 
 
 
This page was created in 32.9 ms