You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Building Iteration Trees
The Journal of Symbolic Logic
Vol. 56, No. 4 (Dec., 1991), pp. 1369-1384
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2275481
Page Count: 16
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
It is shown, assuming the existence of a Woodin cardinal δ, that every tree ordering on some limit ordinal $\lambda < \delta$ with a cofinal branch is the tree ordering of some iteration tree on V.
The Journal of Symbolic Logic © 1991 Association for Symbolic Logic