On the shape of solution sets of systems of (functional) equations

Solution sets of systems of linear equations over fields are characterized as being affine subspaces. But what can we say about the “shape” of the set of all solutions of other systems of equations? We study solution sets over arbitrary algebraic structures, and we give a necessary condition for a set of n-tuples to be the set of solutions of a system of equations in n unknowns over a given algebra. In the case of Boolean equations we obtain a complete characterization, and we also characterize solution sets of systems of Boolean functional equations.