In 2009, Jochen Koenigsmann showed that $\mathbb{Z}$ is universally definable in the field $\mathbb{Q}$. And in 2012, Jennifer Park proved a result which implies that $\mathbb{Z}$ is $\exists\forall$-definable in many if not all finite extensions of $\mathbb{Q}$. And Jan Denef and others showed that $\mathbb{Z}$ is existentially definable in several transcendental extensions of $\mathbb{Q}$, like $\mathbb{R}(t)$ and others. But I'm interested in infinite algebraic extensions.
Now in this paper, Alexandra Shlapentokh discusses $\mathbb{Z}$ being first-order definable in various infinite algebraic extensions of $\mathbb{Q}$. But I'm not sure what the complexities of these first-order definitions are. So my question is, what is the lowest complexity definition of $\mathbb{Z}$ in some infinite algebraic extension of $\mathbb{Q}$?
Note: This is a follow-up to my question here.