Find expressions for each of P Q, P Q, and P Q that use only the

connective . (Your answers should not contain the symbol ¬.) In this case the up arrow is a NAND gate.

Not sure how to go about doing this one, any help would be appreciated.

Printable View

- December 12th 2012, 07:13 AMdom139Need help with Boolean algebra
Find expressions for each of P Q, P Q, and P Q that use only the

connective . (Your answers should not contain the symbol ¬.) In this case the up arrow is a NAND gate.

Not sure how to go about doing this one, any help would be appreciated. - December 12th 2012, 07:18 AMemakarovRe: Need help with Boolean algebra
Note that , so . Now you have negation and conjunction, from which you can express all other connectives.