Write a such SO ( second order) sentence that:
$$\text{ directed } G = (V,E ) \models \phi \iff \text{ G is directed infinite tree where every vertex has finite degree} $$
My solution:
$$\phi = \phi_c \wedge \phi_r \wedge \phi_b \wedge \neg \phi_s$$
$r(p,q) \Leftarrow \exists R R(p,q) \wedge \ R\text{ is transitive } \wedge \forall x \forall y E(x,y) \iff R(x,y)$
says: there exists path between $p,q$
$\phi_c : \forall x \forall y r(x,y) \implies \neg r(y,x)$
There is no cycle.
$neq(p,q) \iff \text{ neq is antysymmetric and transitive } \wedge p \neq q$ $\phi_s: \exists x \exists C \forall c_1 \exists c_2 c_1 \in C \implies e(x,c) \wedge c_2 \in C \wedge neq (c_1, c_2)$
There exists a vertex with infinite degree.
$\phi_r : \exists r \forall x x \neq y \implies R(r,x)$
There exists a root.
$\phi_b: \exists B \forall x x \in B \implies \exists y \in B \wedge (x,y) \wedge y \neq x$
There exists an infinite branch.