Symbolic Logic
1. The problem asks us to express the given statements in symbolic form.
2. For i) "Some students can not appear in exam":
- Let the domain be all students.
- Define the predicate $A(x)$: "$x$ can appear in exam."
- "Some students cannot appear" means there exists at least one student $x$ for which $A(x)$ is false.
- Symbolically: $$\exists x \neg A(x)$$
3. For ii) "Everyone cannot sing":
- Let the domain be all people.
- Define the predicate $S(x)$: "$x$ can sing."
- "Everyone cannot sing" means for all $x$, $S(x)$ is false.
- Symbolically: $$\forall x \neg S(x)$$
Final answers:
i) $$\exists x \neg A(x)$$
ii) $$\forall x \neg S(x)$$