Hostname: page-component-78c5997874-v9fdk Total loading time: 0 Render date: 2024-11-16T15:26:05.213Z Has data issue: false hasContentIssue false
  • English
  • Français

A model of peano arithmetic with no elementary end extension

Published online by Cambridge University Press:  12 March 2014

George Mills
George Mills*
Affiliation:
University of California, Berkeley, CA 94720
Get access Rights & Permissions [Opens in a new window]

Abstract

We construct a model of Peano arithmetic in an uncountable language which has no elementary end extension. This answers a question of Gaifman and contrasts with the well-known theorem of MacDowell and Specker which states that every model of Peano arithmetic in a countable language has an elementary end extension. The construction employs forcing in a nonstandard model.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 43 , Issue 3 , September 1978 , pp. 563 - 567
Copyright
Copyright © Association for Symbolic Logic 1978

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]Gaifman, Haim, Models and types of Peano's arithmetic, Annals of Mathematical Logic, vol. 9 (1976), pp. 223–306.CrossRefGoogle Scholar
[2]MacDowell, R. and Specker, E., Modelle der Arithmetik, Infinitistic Methods, Proceedings of the Symposium on Foundations of Mathematics, Warsaw, 1959, Pergamon Press, New York, Oxford, 1961, pp. 257–263.Google Scholar