Hostname: page-component-8448b6f56d-dnltx Total loading time: 0 Render date: 2024-04-25T02:25:15.110Z Has data issue: false hasContentIssue false

On a problem of MacDowell and Specker

Published online by Cambridge University Press:  12 March 2014

Mark Nadel*
Affiliation:
University of Notre Dame, Notre Dame, Indiana 46556

Extract

Let T extend the theory P of Peano arithmetic, and suppose . Form from a model , in analogy to the way in which the ordered ring of integers is formed from the standard model of arithmetic. Let P′ and T′ be the corresponding analogues of P and T respectively. Now consider the group . In [5] MacDowell and Specker set out to determine the structure of such groups. (The precise statement in [5] refers to the ring of integers rather than the ordered ring. However, as pointed out to us by J. Knight, since Lagrange's Theorem that a positive integer is the sum of four squares is provable in the analogue of P′ for rings (see, for example, the proof in [7, p. 102]), the set of positive elements is definable in the ring, and consequently, so is the ordering. Thus, for the present purpose it makes no difference which of the two structures is used. Of course, one needs the ordering to discuss end extensions, as considered in [5]. On the other hand, one should be aware that in Pr′ one cannot define an ordering, where the theory Pr′ is the theory of the group of integers with distinguished element 1, 〈Z, +, 1〉. The constant 1 is needed so that divisibility mod n can be expressed. We will return to this point later.) In §1 we shall outline the results in this direction obtained in [5].

Lipshitz and Nadel, unaware that a similar question had been posed and investigated in [5] (though, of course aware that [5] contained the celebrated results on end extensions) set out to characterize those models 〈A, +〉 of Pr = Presburger Arithmetic (the complete theory of 〈ω, +〉) which can be expanded to models 〈A, +, ·, 0, 1, ≤〉 of P. They were able to give a complete characterization for countable models 〈A, +〉 in [4], which we describe in §2.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1980

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

REFERENCES

[1]Barwise, K. J. and Schlipf, J., An introduction to recursively saturated and resplendent models, this Journal, vol. 41 (1976), pp. 531536.Google Scholar
[2]Chang, C. C. and Keisler, H. J., Model theory, North-Holland, Amsterdam, 1973.Google Scholar
[3]Kaplansky, I., Infinite Abelian groups, University of Michigan Press, Ann Arbor, 1954.Google Scholar
[4]Lipshitz, L. and Nadel, M., The additive structure of models of arithmetic, Proceedings of the American Mathematical Society, vol. 68 (1978), pp. 331336.CrossRefGoogle Scholar
[5]MacDowell, R. and Specker, E., Modelle der Arithmetik, Infinitistic methods, Pergamon Press, London, 1961, pp. 257263.Google Scholar
[6]Mendelson, E., Introduction to mathematical logic, Van Nostrand, 1964.Google Scholar
[7]Niven, I. and Zuckerman, H., An introduction to the theory of numbers, 2nd edition, Wiley & Sons, New York, 1960.Google Scholar
[8]Sacks, G., Saturated model theory, Benjamin, New York, 1972.Google Scholar
[9]Szmielew, W., Elementary properties of abelian groups, Fundamenta Mathematicae, vol. 41 (1955), pp. 203271.CrossRefGoogle Scholar