Identify the correct translation into logical notation of the following assertion.
\”There is a game which is not played by any student\”.
Note: Played(x,y) is true if x played by y.

(A) ∃x.(game(x) ∧ ∀y.(Student(y) → ¬Played(x,y)))
(B) ∃x.(game(x) ∧ ∀y.(¬Student(y) ∧ Played(x,y)))
(C) ∃x.(game(x) ∧ ∀y.(Student(y) ∧ ¬Played(x,y)))
(D) ∃x.(game(x) → ∀y.(Student(y) → ¬Played(x,y)))


Answer: (A)

Explanation: Exact notation is ∃x.(game(x) ∧ ∀y.(Student(y) → ¬Played(x,y)))


Quiz of this Question