There are two languages $L_1 = \{+\}$, $L_2 = \{\cdot\}$, $L_3 = \{+, \cdot\}$ with equation, where both nonlogical symbols are binary functions. There are formulas:
$$\varphi \equiv \exists n \forall x (n+x = x) \wedge \exists n \forall x(x + n = x) $$ $$\psi \equiv \exists n \forall x (n+x=x \wedge x+n=x) $$ $$\xi \equiv \forall x \forall y \forall z(x \cdot (y+z) = (x\cdot y) + (x\cdot z)) $$ $$\zeta \equiv \forall x \forall y \forall z(x + y = y + x \wedge (x+y)+z = x+(y+z)) $$ $$\eta \equiv \forall x \exists y \forall z((x+y)+z = z)$$
There are theories $T_1 = \{\varphi\}$, $T_2 = \{\psi\}$ under language $L_1$, theory $T_3 = \varnothing$ under lanugage $L_2$, $T_4=\{\psi, \xi, \zeta, \eta\}$, $T_5=\{\xi\}$ under language $L_3$
Could somebody please help me to find out if $T_4$ or $T_5$ is a conservative extension of $T_3$?
Update: I stucked with finding if $T_2$ is [conservative|ordinary] extension of $T_1$. Seems like mathlogics is not my field. Could somebody help me here?