Building Iteration Trees
Andretta, Alessandro
J. Symbolic Logic, Tome 56 (1991) no. 1, p. 1369-1384 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
It is shown, assuming the existence of a Woodin cardinal $\delta$, that every tree ordering on some limit ordinal $\lambda < \delta$ with a cofinal branch is the tree ordering of some iteration tree on $V$.
Publié le : 1991-12-14
Classification:  
@article{1183743821,
     author = {Andretta, Alessandro},
     title = {Building Iteration Trees},
     journal = {J. Symbolic Logic},
     volume = {56},
     number = {1},
     year = {1991},
     pages = { 1369-1384},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183743821}
}

Andretta, Alessandro. Building Iteration Trees. J. Symbolic Logic, Tome 56 (1991) no. 1, pp.  1369-1384. http://gdmltest.u-ga.fr/item/1183743821/