102,815
edits
Changes
→Definitions
*[http://en.wikipedia.org/wiki/16th_century 1594]
*[http://en.wikipedia.org/wiki/16th_century 1594]
==Definitions==
==Definitions==
*1a archaichttp://nordan.daynal.org/wiki/skins/common/images/button_link.png : condition of adhering [[together]] : firmness of [[material]] substance
*1a archaic : condition of [[adhering]] [[together]] : firmness of [[material]] substance
:b : firmness of [[constitution]] or [[character]] : [[persistency]]
:b : firmness of [[constitution]] or [[character]] : [[persistency]]
*2: [[degree]] of firmness, [[density]], viscosity, or resistance to movement or separation of constituent [[particles]] <boil the juice to the consistency of a thick syrup>
*2: [[degree]] of firmness, [[density]], viscosity, or resistance to movement or separation of constituent [[particles]] <boil the juice to the consistency of a thick syrup>
*3a : [[agreement]] or [[harmony]] of parts or features to one another or a whole : [[correspondence]]; specifically : [[ability]] to be asserted together without contradiction
*3a : [[agreement]] or [[harmony]] of parts or features to one another or a whole : [[correspondence]]; specifically : [[ability]] to be asserted together without contradiction
:b : [[harmony]] of [[conduct]] or [[practice]] with [[profession]] <followed her own advice with consistency>
:b : [[harmony]] of [[conduct]] or [[practice]] with [[profession]] <followed her own advice with consistency>
==Description==
==Description==
In [[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 it has a [[model]]; this is the sense used in traditional [http://en.wikipedia.org/wiki/Term_logic Aristotelian logic], although in contemporary [[mathematical]] [[logic]] the term satisfiable is used instead. The [[syntactic]] definition states that a [[theory]] is consistent if there is no [[formula]] P such that both P and its negation are provable from the [[axioms]] of the theory under its associated deductive system.
In [[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 it has a [[model]]; this is the sense used in traditional [http://en.wikipedia.org/wiki/Term_logic Aristotelian logic], although in contemporary [[mathematical]] [[logic]] the term satisfiable is used instead. The [[syntactic]] definition states that a [[theory]] is consistent if there is no [[formula]] P such that both P and its negation are provable from the [[axioms]] of the theory under its associated deductive system.