✳flâneur — a map of the web's best reading

Consistency - Wikipedia

en.wikipedia.org · 4,366 words · saved by 1 readers

In classical deductive logic, a consistent theory is one that does not lead to a logical contradiction.[1] 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, 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 a theory 𝑇 is consistent if there is no formula 𝜑 such that both 𝜑 and its negation ¬ 𝜑 are elements of the set of consequences of 𝑇 . Let 𝐴 be a set of closed sentences (informally "axioms") and ⟨ 𝐴 ⟩ the set of closed sentences provable from 𝐴 under some (specified, possibly implicitly) formal deductive system. The set of axioms 𝐴 is consistent when there is no formula 𝜑 such that 𝜑 ∈ ⟨ 𝐴 ⟩ and ¬ 𝜑 ∈ ⟨ 𝐴 ⟩ .[2] If there exists a deduct

Consistency - Wikipedia Jump to content From Wikipedia, the free encyclopedia Non-contradiction of a theory For other uses, see Consistency (disambiguation) . "Internal logic" redirects here. For the 2012 album by Grass Widow, see Internal Logic (album) . In deductive logic , a consistent theory is one that does not lead to a logical contradiction . [ 1 ] A theory T {\displaystyle T} is consistent if there is no formula φ {\displaystyle \varphi } such that both φ {\displaystyle \varphi } and its negation ¬ φ {\displaystyle \lnot \varphi } are elements of the set of consequences of T {\displays

Explore this link on the map →

related reading