Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-28T15:38:02.908Z Has data issue: false hasContentIssue false
  • English
  • Français

Building iteration trees

Published online by Cambridge University Press:  12 March 2014

Alessandro Andretta
Alessandro Andretta*
Affiliation:
Department of Mathematics and Computer Science, Dartmouth College, Hanover, New Hampshire 03755
Get access Rights & Permissions [Opens in a new window]

Abstract

It is shown, assuming the existence of a Woodin cardinal δ, that every tree ordering on some limit ordinal λ < δ with a cofinal branch is the tree ordering of some iteration tree on V.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 56 , Issue 4 , December 1991 , pp. 1369 - 1384
Copyright
Copyright © Association for Symbolic Logic 1991

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

[J]Jech, T., Set theory, Academic Press, New York, 1978.Google Scholar
[MS1]Martin, D. A. and Steel, J. R., A proof of projective determinacy, Journal of the American Mathematical Society, vol. 2 (1989), pp. 71–126.CrossRefGoogle Scholar
[MS2]Martin, D. A. and Steel, J. R., Iteration trees (to appear).Google Scholar