Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-16T17:14:10.910Z Has data issue: false hasContentIssue false
  • English
  • Français

Saturated models of Peano arithmetic

Published online by Cambridge University Press:  12 March 2014

J. F. Pabion
J. F. Pabion*
Affiliation:
Université Claude Bernard-Lyon 1, 69622 Villeurbanne Cedex, France
Get access Rights & Permissions [Opens in a new window]

Abstract

We study reducts of Peano arithmetic for which conditions of saturation imply the corresponding conditions for the whole model. It is shown that very weak reducts (like pure order) have such a property for κ-saturation in every κ ≥ ω1. In contrast, other reducts do the job for ω and not for κ > ω1. This solves negatively a conjecture of Chang.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 47 , Issue 3 , September 1982 , pp. 625 - 637
Copyright
Copyright © Association for Symbolic Logic 1982

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]Chang, C. C. and Keisler, H. J., Model theory, North-Holland, Amsterdam, 1973.Google Scholar
[2]Lucas, F., Thèse de 3® Cycle, Université de Paris VII, Paris.Google Scholar
[3]Richard, D., Thèse de 3® Cycle, Université Claude-Bernard-Lyon, 1979.Google Scholar
[4]Shoenfield, R., Mathematical logic, Addison-Wesley, Reading, Mass., 1967.Google Scholar