Definition:Consistent/Proof System/Propositional Logic/Definition 2

From ProofWiki
Jump to: navigation, search


Let $\mathcal L$ be the language of propositional logic.

Let $\mathscr P$ be a proof system for $\mathcal L_0$.

Suppose that in $\mathscr P$, the Rule of Explosion (Variant 3) holds.

Then $\mathscr P$ is consistent if and only if:

For every logical formula $\phi$, not both of $\phi$ and $\neg \phi$ are theorems of $\mathscr P$