# Consistency proof

in logic, property of a theory that does not contain a contradiction

In mathematics, a theory is called consistent, if does not contain any contradictions. In the context of predicate logic it is impossible to deduce both ${\displaystyle \varphi }$ as well as ${\displaystyle \neg \varphi }$ from ${\displaystyle \Phi }$