Consistency proof

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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