Consistency proof

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 [math]\displaystyle{ \varphi }[/math] as well as [math]\displaystyle{ \neg \varphi }[/math] from [math]\displaystyle{ \Phi }[/math] Template:Math-stub