Scott sentences for equivalence structures (Q2309506)

The author gives an example of an equivalence structure for which the index set is \(m\)-complete \(\Pi_3^0\) but for which there is no computable \(\Pi_3\) Scott sentence. It follows from the author's result that if a computable equivalence structure with infinitely many infinite equivalence classes and with arbirarily large finite classes satisfies a \(\Sigma_4\) sentence \(\varphi\) then it has a substructure with finitely many infinite classes satisfying the same sentence \(\varphi\).