CONSISTENCY
Consistency
In classical deductive logic, a consistent theory is one that does not contain a contradiction. The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a theory is consistent if and only if it has a model, i.e. there exists an interpretation under which all formulas in the theory are true. This is the sense used in traditional Aristotelian logic, although in contemporary mathematical logic the term satisfiable is used instead. The syntactic definition states that a theory is consistent if and only if there is no formula P such that both P and its negation are provable ...The above text is a snippet from Wikipedia: Consistency
and as such is available under the Creative Commons Attribution/Share-Alike License.
consistency
Noun
- Local coherence.
- Correspondence or compatibility.
- Reliability or uniformity; the quality of being consistent.
- The degree of viscosity of something.
- Freedom from contradiction; the state of a system of axioms such that none of the propositions deduced from them are mutually contradictory.
- Firmness of constitution or character; substantiality; durability; persistency.
The above text is a snippet from Wiktionary: consistency
and as such is available under the Creative Commons Attribution/Share-Alike License.