Do $\mathbb{C}$ and $\mathbb{A}$ (algebraic complex numbers) satisfy the same sentences in the language of fields? This was an optional question on an assignment for a first course in logic, model theory and set theory.
From my research on Google, I've found a notion of "elementary equivalence" of language structures which then guided me towards "Tarski-Vaught Principle", which says the following:
Tarski-Vaught Principle: let $M$ be an $L$-structure and $N$ a substructure of $M$. Then $N$ is an elementary substructure of $M$ iff $M \vDash \exists x \phi(x, b_1, \dots, b_n)$ then there is an element $a$ in $N$ such that $M \vDash \phi(a, b_1, \dots, b_n)$, where $\phi(x, y_1, \dots, y_n)$ is a first order formula over $L$ and $b_1, \dots, b_n$ are in $N$.
Intuitively, to me this means that $\mathbb{A}$ should satisfy any sentence that $\mathbb{C}$ does: since $\mathbb{A}$ is defined to be closed under algebraic operations, and the only sentences that can be made in this language are sentences about algebraic operations on elements. The only bad sort of sentence I can think of is something like $\exists x \ \text{s.t.} \ x \ \text{is not a root of any polynomial}$ but this would really require infinitely many sentences to write in the language of fields.
As requested in the comments, I will mention that my course does not cover anything in particular about algebraically closed fields or the theory of algebraically closed fields. I've seen in an exercise that the theory of algebraically closed fields is not finitely axiomatisable, but beyond this I have no special knowledge of the theory of algebraically closed fields.