## Access

You are not currently logged in.

Access JSTOR through your library or other institution:

## If You Use a Screen Reader

This 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

Alessandro Andretta
The Journal of Symbolic Logic
Vol. 56, No. 4 (Dec., 1991), pp. 1369-1384
DOI: 10.2307/2275481
Stable URL: http://www.jstor.org/stable/2275481
Page Count: 16
Preview not available

## Abstract

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.

• 1369
• 1370
• 1371
• 1372
• 1373
• 1374
• 1375
• 1376
• 1377
• 1378
• 1379
• 1380
• 1381
• 1382
• 1383
• 1384