0 votes 0 votes Show that p NAND q is logically equivalent to ¬(p ∧ q). how to prove this and i prove using truth table which is easy but how to prove using logical identities ? thank you Mathematical Logic discrete-mathematics mathematical-logic propositional-logic engineering-mathematics kenneth-rosen + – ykrishnay asked Feb 21, 2022 ykrishnay 519 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes 1. https://mathcs.clarku.edu/~djoyce/ma114/Sec12.pdf 2. https://math.stackexchange.com/questions/2107663/nand-xor-and-and 22 answered Feb 21, 2022 22 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Solved by using by case method. preeti0448 answered Mar 14, 2022 preeti0448 comment Share Follow See all 0 reply Please log in or register to add a comment.