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 $\varphi$ as well as $\neg \varphi$ from $\Phi$

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.