Home
Random
Log in
Settings
Donate
About Wikiversity
Disclaimers
Search
Propositional logic/De Morgan's laws/Proof/Exercise
Language
Watch
Edit
Prove, with help of truth tables, the
De Morgan's laws
, namely that the statements
¬
(
β
∨
γ
)
↔
(
¬
β
∧
¬
γ
)
{\displaystyle \neg {\left(\beta \vee \gamma \right)}\leftrightarrow {\left(\neg \beta \wedge \neg \gamma \right)}}
and
¬
(
β
∧
γ
)
↔
(
¬
β
∨
¬
γ
)
{\displaystyle \neg {\left(\beta \wedge \gamma \right)}\leftrightarrow {\left(\neg \beta \vee \neg \gamma \right)}}
are
tautologies.
Create a solution