Hostname: page-component-cc8bf7c57-llmch Total loading time: 0 Render date: 2024-12-11T22:55:57.593Z Has data issue: false hasContentIssue false
  • English
  • Français

A uniqueness theorem for iterations

Published online by Cambridge University Press:  12 March 2014

Paul Larson
Paul Larson*
Affiliation:
Department of Mathematics, University of Toronto, Toronto M5S 3G3, Canada, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

If M is a countable transitive model of , then for every real x there is a unique shortest iteration j: M → N with x ∈ N, or none at all.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 67 , Issue 4 , December 2002 , pp. 1344 - 1350
Copyright
Copyright © Association for Symbolic Logic 2002

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]Jensen, R. B. and Solovay, R. M., Some applications of almost disjoint sets, Mathematical logic and foundations of set theory (Proceedings of the international colloquium, Jerusalem, 1968), North-Holland, Amsterdam, 1970, pp. 84–104.Google Scholar
[2]Larson, P., ℙmax with generic iterations, in preparation.Google Scholar
[3]Larson, P. and Todorčević, S., Chain conditions in maximal models, Fundamenta Mathematicae, vol. 168 (2001), no. 1, pp. 77–104.CrossRefGoogle Scholar
[4]Woodin, W. H., The axiom of determinacy, forcing axioms, and the nonstationary ideal, DeGruyter Series in Logic and Its Applications, vol. 1, 1999.CrossRefGoogle Scholar