Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T05:23:39.037Z Has data issue: false hasContentIssue false
  • English
  • Français

Continuity and elementary logic1

Published online by Cambridge University Press:  12 March 2014

Leslie H. Tharp
Leslie H. Tharp*
Affiliation:
The Rockefeller University, New York, New York 10021
Get accessRights & Permissions [Opens in a new window]

Extract

The purpose of this paper is to investigate continuity properties arising in elementary (i.e., first-order) logic in the hope of illuminating the special status of this logic. The continuity properties turn out to be closely related to conditions which characterize elementary logic uniquely, and lead to various further questions.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 39 , Issue 4 , December 1974, pp. 700 - 716
Copyright
Copyright © Association for Symbolic Logic 1974

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.)

Article purchase

Temporarily unavailable

Footnotes

1

The notes [7] and [8], and the paper [9], contain announcements of some of the results and related material. I wish to thank Per Lindström, D. A. Martin and Scott Weinstein for many helpful suggestions; also, several clarifications of an earlier draft were stimulated by William Craig's criticism. The final draft owes much to the suggestions of the referee.

References

REFERENCES

[1] Jensen, Ronald B., Ein Neuer Beweis für die Entscheidbarkeit des einstelligen Prädikatenkalküls mit Identität, Archiv für mathematische Logik und Grundlagenforschung, No. 7 (1965).Google Scholar
[2] Lindström, Per, First order predicate logic with generalized quantifiers, Theoria, vol. 32 (1966).Google Scholar
[3] Lindström, Per, On extensions of elementary logic, Theoria, vol. 35 (1969).CrossRefGoogle Scholar
[4] Tarski, A. and Vaught, R. L., Arithmetical extensions of relational systems, Compositio Mathematica, vol. 13 (1957).Google Scholar
[5] Shoenfield, Joseph R., Mathematical logic, Addison-Wesley, Reading, Mass., 1967.Google Scholar
[6] Bell, J. L. and Slomson, A. B., Models and ultraproducts, North-Holland, Amsterdam, 1969.Google Scholar
[7] Tharp, L. H., The uniqueness of elementary logic, Notices of the American Mathematical Society, vol. 20 (1973), p. A–23.Google Scholar
[8] Tharp, L. H., Continuous quantifiers, Notices of the American Mathematical Society, vol. 20 (1973), p. A–339.Google Scholar
[9] Tharp, L. H., The characterization of monadic logic, this Journal, vol. 38 (1973).Google Scholar
[10] Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[11] Barwise, J., Inftnitary logic and admissible sets, this Journal, vol. 34 (1969).Google Scholar
[12] Makowsky, J. A., On continuous quantifiers, Notices of the American Mathematical Society, vol. 20 (1973), p. A–502.Google Scholar
[13] Makowsky, J. A., More about continuous quantifiers, Notices of the American Mathematical Society, vol. 21 (1974), p. A–321.Google Scholar