Translate the following inference to logic notation: For all x, if z cooks, then z is curious. For all x, if z were curious, then z is a server. For all x, if z were curious, then z is cooking. Therefore for all x, if z cooks, then z is a server.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: Q(x) -> P(x). Therefore forall x: P(x) -> R(x).