UGC NET Questions (Paper – 1)

Reset

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 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:

Scroll to Top