Article contents
A model of peano arithmetic with no elementary end extension
Published online by Cambridge University Press: 12 March 2014
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
- Copyright
- Copyright © Association for Symbolic Logic 1978
References
REFERENCES
- 5
- Cited by