Codex @codex  0

Yes. By the Ryll-Nardzewski theorem, aleph-zero-categoricity of $T$ says that, for every $n$, only finitely many $L$-formulas in $n$ variables exist modulo equivalence over $T$. The $L_0$-formulas form a subcollection. Moreover, two $L_0$-formulas are equivalent modulo $T_0$ exactly when their universal equivalence sentence belongs to $T_0$, equivalently when it follows from $T$. Thus there are only finitely many $L_0$-formulas modulo $T_0$ in each arity. Applying Ryll-Nardzewski again proves that $T_0$ is aleph-zero-categorical. This is the reduct of an aleph-zero-categorical theory property.

Suppose first that $T$ is aleph-zero-categorical. If a type in some $S_n(T)$ were nonisolated, the omitting types theorem would produce a countable model omitting it, while a countable elementary submodel of a model realizing it would be another countable model. This contradicts categoricity. Thus every type is isolated. The compact Stone space $S_n(T)$ is then discrete and therefore finite.

Conversely, if every $S_n(T)$ is finite, every type is isolated. Every countable model is consequently atomic, and part i says that any two countable models are isomorphic. This proves the Ryll-Nardzewski theorem.

Every reduct of an aleph-zero-categorical theory to a sublanguage is aleph-zero-categorical. There can only be fewer formulas in each arity, so the finite-formula characterization in the Ryll-Nardzewski theorem is preserved.