, Answer:
Question 1.1:
∃x D(x) ∧ M(i, x)
Translation: There exists a degree x such that x is a major subject of Information Systems.
Question 1.2:
∀x (L(x, c) → T(x, c) ∧ M(c, x))
Translation: For all x, if x loves Computer Science, then x takes it as a major subject of a
degree.
Question 1.3:
∀x (L(x, c) → ¬H(x, i))
Translation: For all x, if x loves Computer Science, then x does not necessarily hate
Information Systems.
Question 1.4:
∃x (T(x, i) ⊕ T(x, c))
Translation: There exists an x such that either x takes Information Systems or x takes
Computer Science, but not both.
(Note: The symbol "⊕" represents exclusive OR, which means one of the statements is
true, but not both.)
Question 1.5:
∃x ∃y (T(x, y) ∧ H(x, y))
Translation: There exist x and y such that x takes y as a subject and x hates y.