Einfach
einen Begriff in der Tabelle rechts anklicken um weitere Übersetzungen in dieser Sidebar zu erhalten.
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. A theory
T
{displaystyle T}
is consistent if and only if there is no formula
ϕ
{displaystyle phi }
such that both
ϕ
{displaystyle phi }
and its negation
¬
ϕ
{displaystyle lnot phi }
are elements of the set
T
{displaystyle T}
. Let
A
{displaystyle A}
be set of closed sentences and
⟨
A
⟩
{displaystyle langle A
angle }
the set of closed sentences provable from
A
{displaystyle A}
under a meta-theoretical deductive system such as informal mathematics. The set of axioms
A
{displaystyle A}
is consistent when
⟨
A
⟩
{displaystyle langle A
angle }
is.