Let $F$ be the class of formulae written in some given language $\mathcal{L}$ and said language contains relation operators such as $=$, $<$, $>$, $\geq$, $\leq$, $\equiv$, $\sim$, $\approx$. Let $E$ be the class of equations or inequalities. Then $v \in E$ is an equation/inequality or set of equations/inequalities (for systems).
Let $f : E \mapsto Op \subset F$ be a map which picks out the operators (formulae with free parameters in any orders of logic) and arrange them into an ordered set in Op. Let the solution class of $E$ be $X \subset F$. Now, the existence of solutions is defined by …