Hi hi please helppppppppppooooooooo
2 answers:
You might be interested in
Answer:
(i) A truth table shows how the truth or falsity of a compound statement depends on the truth or falsity of the simple statements from which it's constructed.
Since A ∧ B (the symbol ∧ means A and B) is true only when both A and B are true, its negation A NAND B is true as long as one of A or B is false.
Since A ∨ B (the symbol ∨ means A or B) is true when one of A or B is true, its negation A NOR B is only true when both A and B are false.
Below are the truth tables for NAND and NOR connectives.
(ii) To show that (A NAND B)∨(A NOR B) is equivalent to (A NAND B) we build the truth table.
Since the last column (A NAND B)∨(A NOR B) is equal to (A NAND B) it follows that the statements are equivalent.
(iii) To show that (A NAND B)∧(A NOR B) is equivalent to (A NOR B) we build the truth table.
Since the last column (A NAND B)∧(A NOR B) is equal to (A NOR B) it follows that the statements are equivalent.
