Hostname: page-component-76fb5796d-qxdb6 Total loading time: 0 Render date: 2024-04-26T02:46:01.899Z Has data issue: false hasContentIssue false
  • English
  • Français

On the axiomatizability of uniform spaces

Published online by Cambridge University Press:  12 March 2014

Ralph Kopperman
Ralph Kopperman*
Affiliation:
University of Rhode Island
Get access Rights & Permissions [Opens in a new window]

Extract

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.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 32 , Issue 3 , 09 October 1967 , pp. 289 - 294
Copyright
Copyright © Association for Symbolic Logic 1967

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Hanf, W., Some fundamental problems concerning languages with infinitely long expressions Doctoral Dissertation, University of California, Berkeley, 1962.Google Scholar
[2]Karp, C., Completeness proof in predicate logic with infinitely long expressions, this Journal, vol. 32 (1967).Google Scholar
[3]Keisler, H., Ultraproducts and elementary classes, Koninklijke Nederlandse Akademie Van Wetenschappen, Proceedings, Series A, Mathematical Sciences, Volume LXIV, North-Holland Publishing Co., Amsterdam, 1961.Google Scholar
[4]Kelley, J., General topology, D. Van Nostrand Co., New York, 1955.Google Scholar
[5]Kopperman, R., The Lω1ω1-theory of Hilbert spaces, this Journal, this issue, pp. 295–304.Google Scholar
[6]Robinson, A., Complete theories, North-Holland Publishing Co., Amsterdam, 1956.Google Scholar