Algebraic Structures: Does Order Matter? (I want to link to similar question with a very good answer: Question about Algebraic structure?)
An algebraic structure is an ordered tuple of sets. One of these is called the underlying set, and the others are operations of various arity. Since operations are functions, which are sets of ordered pairs, this is why we can interpret the components of an algebraic structure to be sets.
For example, a group is a quadruple $(G,0,-,+)$ where


*

*$G$ is the underlying set,

*$0 \subseteq G^0 \times G$ is a nullary operation,

*$- \subseteq G \times G$ is a unary operation, and

*$+ \subseteq G^2 \times G$ is a binary operation.


My question is why we choose an ordered tuple to describe the algebraic structure. For instance, does it make a difference if I define a group to be $(G,+,-,0)$, where I list the operations in order of descending, rather than ascending, arity? If the order doesn't matter, why don't we just define a group to be $\{G,0,-,+\}$, rather than an ordered tuple?
Thanks!

The reason is really silly in some sense. Since all the objects ($G,+$ and so on) are sets, how can you know which one is the group, and which one is the addition? 
You can say, well, $+\subseteq G^2\times G$. But there are sets $X$ such that $X^2\times X\subseteq X$. So it's really not so obvious as much as we might want it to be.
On the other hand, in an ordered set, you can say that the first element is the group, the second is the operation $+$, and so on.
If you want to be fully formal, a structure is really just an ordered pair $(M,\Sigma)$ where $\Sigma$ is the interpretation function which maps the function, relation and constant symbols of the language to their interpretation in $M$. Just when the language we work in is simple enough, we might skip that and write directly the tuple (knowing full well that the reader will not be confused if we wrote $(G,0,+,-)$ or $(G,+,0,-)$).
