Q: Which of the following statements about logical connectives are correct?
(A) In classical logic, the conjunction p ∧ q is true exactly when at least one of p or q is true;
(B) The inclusive disjunction p ∨ q is false exactly when both p and q are false;
(C) The negation of (p ∧ q) is logically equivalent to (¬p ∨ ¬q);
(D) The negation of (p ∨ q) is logically equivalent to (¬p ∧ ¬q);
(E) In classical two-valued logic, a statement and its negation can both be true at the same time;
Choose the correct answer from the options given below:
Q: Which of the following statements about quantifiers and their negations are correct?
(A) The universal quantifier ∀x P(x) asserts that P(x) holds for every element x in the domain;
(B) The existential quantifier ∃x P(x) asserts that there exists at least one element x in the domain for which P(x) holds;
(C) The statement ∀x P(x) is logically equivalent to ∃x P(x) for any predicate P;
(D) The negation of ∀x P(x) is logically equivalent to ∃x ¬P(x);
(E) Quantified statements are used in mathematics to express general laws and existence claims;
Choose the correct answer from the options given below:
Q: Which of the following statements about logical equivalence and De Morgan’s laws are correct?
(A) The negation of “p and q” is logically equivalent to “not p or not q”;
(B) The negation of “p or q” is logically equivalent to “not p and not q”;
(C) Two statements are logically equivalent if they have the same truth value in every possible situation;
(D) De Morgan’s laws describe relationships between conjunction, disjunction and negation;
(E) Contradictory statements are true together in at least one possible situation;
Choose the correct answer from the options given below:
Q: Which of the following statements about negation are correct?
(A) The negation of “All S are P” in standard logic is “No S are P”;
(B) The negation of “Some S are P” is “No S are P”;
(C) The negation of “p and q” is logically equivalent to “not p or not q”;
(D) The negation of “p or q” is logically equivalent to “not p and not q”;
(E) In UGC NET reasoning, correctly forming the negation of a statement is useful for syllogism and data sufficiency questions;
Choose the correct answer from the options given below:

Comment Your Answer
Please login to comment your answer.
Sign In
Sign Up
Answers commented by others
No answers commented yet. Be the first to comment!