Abstract We can measure the complexity of a logical formula by counting number alternations between existential and universal quantifiers. Suppose that an elementary first-order $\varphi $ (in $\mathcal {L}_{\omega ,\omega }$ ) is equivalent to infinitary language {L}_{\infty with n prove finitary Thus using logic does not allow us express in simpler way.