We know that :
Let $\mathbb{R}$ denote the set of all real numbers. Then:
1-) The set $\mathbb{R}$ is a field, meaning that addition and multiplication are defined and have the usual properties.
2-)The field $\mathbb{R}$ is ordered, meaning that there is a total order ≥ such that, for all real numbers $x, y$ and $z$:
if $x ≥ y$ then $x + z ≥ y + z$;
if $x ≥ 0$ and $y ≥ 0$ then $xy ≥ 0$.
The order is Dedekind-complete; that is: every non-empty subset $S$ of $\mathbb{R}$ with an upper bound in $\mathbb{R}$ has a least upper bound (also called supremum) in $\mathbb{R}$ .
And also we study in universal algebra that :
If $\mathcal{L}$ is a first-order language, then a (first-order) structure of type $\mathcal L$(or $\mathcal{L}$-structure) is an ordered pair $\mathbf{A}=\langle A , L \rangle $ , with $A = ∅$, where $L$ consists of a family $R$ of fundamental relations $r^{\mathbf{A} }$ on $A$ indexed by ${\mathcal R }$ (with the arity of $r^{\mathbf{A} }$ equal to the arity of $r$ , for $r ∈ \mathbf{R} $) and a family $F$ of fundamental operations $f^{\mathbf{A}}$ on $A$ indexed by $\mathcal{F}$ (with the arity of $f^{\mathbf{A}}$ equal to the arity of $f$, for $f \in \mathcal{F}$). A is called the universe of $A$, and in practice we usually write just $r$ for $r^{\mathbf{A}}$ and $f$ for $f^{\mathbf{A}}$ A. If $\mathcal R = ∅$ then $\mathbf A$ is an algebra; if $\mathcal F = ∅ $then $\mathbf A$ is a relational structure. If $\mathcal{L}$ is finite, say $\mathcal F = \lbrace {f_1, . . . , f_m}\rbrace $, $\mathcal R = \lbrace r_1, . . . , r_n \rbrace$, then we often write $\langle A, f_1, . . . , f_m, r_1, . . . , r_n \rangle$ instead of $\langle A, L \rangle $.
Now how can we define real number to form of a (first-order) structure of type $\mathcal L$ ?