Category:Double Negation Elimination

From ProofWiki
Jump to navigation Jump to search

This category contains pages concerning Double Negation Elimination:

The rule of double negation elimination is a valid argument in certain types of logic dealing with negation $\neg$.

This includes classical propositional logic and predicate logic, and in particular natural deduction, but for example not intuitionistic propositional logic.

Proof Rule

If we can conclude $\neg \neg \phi$, then we may infer $\phi$.

Sequent Form

$\neg \neg p \vdash p$