I am learning boolean algebra. So apologies for this naive question. During our discussion among friends, we came across following puzzle,
How can I convert following statement into CNF and DNF?
$$ A \wedge \neg A $$
Is it following for CNF? $$ (A \vee A ) \wedge ( \neg A \vee \neg A) $$
Similarly, for DNF, is following correct?
$$ (A \wedge \neg A ) \vee ( A \wedge \neg A ) $$
I tried to use truth table method like shown in this post, but answer to this statement is always false
. So how can I build DNF for such statement from truth table?