# Consistency proof

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