On the axiomatizability of uniform spaces
Ralph D. Kopperman · Journal of Symbolic Logic · 1967
A great deal of the interest in the theory of models of sets of sentences in the lower predicate calculus is due to the increasing success with which this theory has been applied to problems from algebra (see, for example [6, particularly pp. 90–103]). The existence of nonstandard models prevents this language from being altogether appropriate for application to analysis.