Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-03T08:49:00.864Z Has data issue: false hasContentIssue false
  • English
  • Français

On Languages Which are Based on Non-Standard Arithmetic1)

Published online by Cambridge University Press:  22 January 2016

Abraham Robinson
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The natural numbers play a part in the formulation of logical syntax inasmuch as they are used to count the symbols in a sentence, or the sentences in a proof, etc. In the present paper, we shall study an infinitary logical calculus which is based on replacing the ordinary natural numbers in the capacity just mentioned, by a non-standard model of arithmetic. (Compare refs. 3, 5, 6 for some other logical calculi of infinitary nature). Thus, our calculus will include formulae of length n for any natural number n, finite or infinite, in the chosen non-standard model of arithmetic. Evidently, the study of such formulae can be of interest only if we introduce concepts which are beyond the power of expression of the notions borrowed from the standard case. It turns out that the concept of truth in a model, when defined by means of Skolem functions has this character and involves a curious phenomenon which is analogous to one first pointed out by H. Steinhaus and J. Mycielski for another kind of infinitary language. Thus, while in the standard predicate calculus the negation of a sentence in prenex normal form is reduced to prenex normal form by changing the type of the quantifiers and by shifting the sign of negation, this procedure is not legitimate when truth is defined in this way in our calculus.

Type
Research Article
Information
Nagoya Mathematical Journal , Volume 22 , June 1963 , pp. 83 - 117
Copyright
Copyright © Editorial Board of Nagoya Mathematical Journal 1963

Footnotes

1)

The work on the present paper was carried out in part while the author held a grant from the National Science Foundation (No. G 14006) at the University of California in Berkeley.

References

[1] Craig, W., Three uses of the Her brand-Gentzen theorem in relating model theory and proof theory, Journal of Symbolic Logic, vol. 22 (1957), pp. 269–285.Google Scholar
[2] Henkin, L., Completeness in the theory of types, Journal of Symbolic Logic, vol. 15 (1950), pp. 81–91.Google Scholar
[3] Henkin, L., Some remarks on infinitely long formulas, Infinitistic Methods—Fr oceeäings of the Symposium on Foundations of Mathematics, Warsaw 1959—pub. 1961, pp. 167–183.Google Scholar
[4] Robinson, A., Model theory and non-standard arithmetic, Infinitistic Methods—Proceedings of the Symposium on Foundations of Mathematics, Warsaw 1959—pub. 1961, pp. 265–302.Google Scholar
[5] Scott, D. and Tarski, A., The sentential calculus with infinitely long expressions, Colloquium Mathematicum, vol. 6 (1958), pp. 165–170.Google Scholar
[6] Tarski, A., Remarks on predicate logic with infinitely long expressions, Colloquium Mathematicum, vol. 6 (1958), pp. 171–176.Google Scholar
[7] Tarski, A., Mostowski, A. and Robinson, R. M., Undecidable Theories, Studies in Logic and the Foundations of Mathemctics, Amsterdam 1953.Google Scholar