Q. If in a for it to be complete it is necessary for switch A to be closed and either of switch B or C to be closed, then which can be true?

View solution

Q. Which of the following statements is the negation of the statements “4 is odd or -9 is positive”?

View solution

Q. Which of the following represents: ~A (negation of A) if A stands for “I like badminton but hate maths”?

View solution

Q. The compound statement A v ~(A ∧ B).

View solution

Q. Which of the following is De-Morgan’s law?

View solution

Q. What is the dual of (A ∧ B) v (C ∧ D)?

View solution

Q. ~ A v ~ B is logically equivalent to?

View solution

Q. Negation of statement (A ∧ B) → (B ∧ C) is _____________

View solution

Q. Which of the following satisfies commutative law?

View solution

Q. If the truth value of A v B is true, then truth value of ~A ∧ B can be ___________

View solution

Q. If P is always against the testimony of Q, then the compound statement P→(P v ~Q) is a __________

View solution

Q. A compound proposition that is always ___________ is called a tautology.

View solution

Q. A compound proposition that is always ___________ is called a contradiction.

View solution

Q. If A is any statement, then which of the following is a tautology?

View solution

Q. If A is any statement, then which of the following is not a contradiction?

View solution

Q. A compound proposition that is neither a tautology nor a contradiction is called a ___________

View solution

Q. ¬ (A ∨ q) ∧ (A ∧ q) is a ___________

View solution

Q. (A ∨ ¬A) ∨ (q ∨ T) is a __________

View solution

Q. A ∧ ¬(A ∨ (A ∧ T)) is always __________

View solution

Q. (A ∨ F) ∨ (A ∨ T) is always _________

View solution