Q3.Marks: +2.0UGC NET Paper 2: Computer Science 11 March 2023
The negation of "Some students like hockey" is:
1.Some students dislike hockey
2.Every student dislike hockey✓ Correct
3.Every student like hockey
4.All students like hockey
Solution
The correct answer is Every student dislike hockey
Key Points
The original statement, "Some students like hockey," is an example of a quantified statement in logic.
The quantifier "Some" refers to the existence of at least one student who likes hockey. In symbolic logic, this statement can be represented as ∃ (there exists) student (S) such that they like hockey (H).
Now, when we negate this statement, we are essentially saying that it is not true that there exists a student who likes hockey.
In symbolic logic, the negation would be ¬∃S(H), which is equivalent to ∀S(¬H), where ∀ denotes "for all" or "every."
So, the negation "Every student dislikes hockey" is expressing that for every student, it is not the case that they like hockey.