Consider for example the theory of partial ordered groups:
In their language there is a binary operation symbol, $\cdot$ (the multiplication), a constant symbol $1$ (the unit), a unary operation symbol ${()}^{-1}$, and a binary relation symbol $\le$. (The equality symbol is usually assumed to be also present, by default.) An axiom system for it is the $6$ element set $T$ of the following formulas ($T$ itself is also called the theory):
- $\forall x\forall y\forall z \ ((x\cdot y)\cdot z=x\cdot(y\cdot z))$
- $\forall x\ (1\cdot x=x)$
- $\forall x\ (x^{-1}\cdot x=1)$
- $\forall x\ (x\le x)$
- $\forall x\forall y\forall z\ ((x\le y\,\land\, y\le z )\implies x\le z)$
- $\forall x\forall y\forall z\ (x\le y \implies (x\cdot z\le y\cdot z\ \land\ z\cdot x\le z\cdot y) )$
A model of $T$ is a realization of the operation and relation symbols on a base set such that they satisfy the axioms. So, first we have to consider a model $\mathfrak M$ for the given first order language: it is thus far nothing else than a set $M$, equipped with a binary ($\mu:M\times M\to M$), a unary ($\sigma:M\to M$) and a constant ($c\in M$) operation, and a binary relation $(L\subseteq M\times M)$.
This $\mathfrak M$ is said to be a model for $T$, if all elemets of $T$ is satisfied on $\mathfrak M$ when interpreting the symbols accordingly, with respect to all evaluations of the variables (whenever the variable $x$ is evaluated in $M$, $x\cdot y$ is evaluated as $\mu(x,y)$, $x^{-1}$ as $\sigma(x)$, $1$ as $c$, and $x\le y$ as $(x,y)\in L$).