You have raised a most-interesting question which has a beautiful solution.
The floor-function is characterized by the following formula,
$\boxed{
\;\; \forall n \in \mathbb{Z},x \in \mathbb{R} :: n \leq \lfloor x \rfloor \equiv n \leq x \;\;
}$
Indeed this states that ``$\lfloor x \rfloor$ is the greatest integer that is at-most $x$'':
$\lfloor x \rfloor$ is an ingeter at-most $x$ ---ie $x \leq \lfloor x \rfloor$.
We obtain this my taking $n = \lfloor x \rfloor$ in the above formula.
It is also the largest such integer :
$\forall n \in \mathbb{Z},x \in \mathbb{R} :: n \leq x \implies n \leq \lfloor x \rfloor$. We obtain this from the characterization by weakening the equivalence $\equiv$ into an implication $\implies$.
Some immediate results from the characterization, for $n \in \mathbb{Z}, x \in \mathbb{R}$, are
$\lfloor x \rfloor < n \equiv x < n$, by negating the equivalence.
$\lfloor x \rfloor \leq x$, by taking $n = \lfloor x \rfloor$. [Contracting]
$\lfloor x \rfloor \leq \lfloor y \rfloor \Leftarrow x \leq y$, proven by the characterization and properties of $\leq$. [Order preserving]
$\lfloor \lfloor x \rfloor \rfloor = \lfloor x \rfloor$, characterization again. [Idempotent]
Other nifty theorems can be easily proven from this characterization, such as
$n = \lfloor x \rfloor \, \equiv \, ( n \leq x \text{ and } x<n+1)$
$\lfloor x+n \rfloor = \lfloor x \rfloor + n$
$\lfloor x \rfloor + \lfloor y \rfloor \leq \lfloor x+y \rfloor $
$0\leq x \implies \lfloor \sqrt{\lfloor x \rfloor} \rfloor = \lfloor \sqrt{x} \rfloor$
Unlike the other answers presented earlier, this characterization shows its power in reasoning. For example, try proving one of the above theorems using one of the definitions presented by the others and then compare that with a proof using the characterization presented here.
These theorems and the characterization are explored in Feijen's ``The Joy of Formula Manipulation'', http://www.mathmeth.com/wf/files/wf2xx/wf268t.pdf.
Best regards,
Moses