When does it not lie? (Boolean Algebra)

Algebra Level 1

When is the Boolean expression ( ¬ p ) ( ¬ q ) (\neg p) \wedge (\neg q) true?

When p p is false and q q is true When p p and q q are both true When p p and q q are both false When p p is true and q q is false

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Ashish Menon
Apr 22, 2016

When p and q are false, their negations would be true and the ^ operator gives a valid expression only when all parts of the sentence are true. So, the final answer is that both p and q are false.

Alternatively, we can use de morgan's laws .

( ¬ p ) ( ¬ q ) (\neg p) \wedge (\neg q) is identical to ¬ ( p q ) \neg (p \vee q) .

¬ ( p q ) \neg (p \vee q) is true when ( p q ) (p \vee q) is false, which happens if and only if both p p and q q are false.

Pranshu Gaba - 5 years, 1 month ago

Log in to reply

Yes, :+1: :)

Ashish Menon - 5 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...