Language of ordered rings
= Language of ordered rings
{title2=$\{0,1,+,\times,<,=\}$}
For coding <arithmetic> computations, the signature in use is $0,1,+,\times,<,=$. Bounded remainder tests and polynomial equations use only these symbols. This is a statement about the language: interpretation in the <natural numbers> does not impose the axioms of a ring.