De Morgan's laws for classical propositional logic


THEOREM    \(\neg (P \wedge Q) \vdash \neg P \vee \neg Q\)

Proof available

THEOREM    \(\neg P \vee \neg Q \vdash \neg (P \wedge Q)\)

Proof available

THEOREM    \(\neg(P \wedge Q) \dashv\vdash \neg P \vee \neg Q\)

Proof available

THEOREM    \(\neg (P \vee Q) \vdash \neg P \wedge \neg Q\)

Proof available

THEOREM    \(\neg P \wedge \neg Q \vdash \neg (P \vee Q)\)

Proof available

THEOREM    \(\neg(P \vee Q) \dashv\vdash \neg P \wedge \neg Q\)

Proof available

Parent topics