Building iteration trees

Journal of Symbolic Logic 56 (4):1369-1384 (1991)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On the consistency of the definable tree property on ℵ.Amir Leshem - 2000 - Journal of Symbolic Logic 65 (3):1204 - 1214.
Canonical seeds and Prikry trees.Joel David Hamkins - 1997 - Journal of Symbolic Logic 62 (2):373-396.
Trees and diagrams of decomposition.Anita Wasilewska - 1985 - Studia Logica 44 (2):139 - 158.
Iterates of the Core Model.Ralf Schindler - 2006 - Journal of Symbolic Logic 71 (1):241 - 251.

Analytics

Added to PP
2009-01-28

Downloads
18 (#708,051)

6 months
1 (#1,027,696)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Large cardinals and iteration trees of height ω.Alessandro Andretta - 1991 - Annals of Pure and Applied Logic 54 (1):1-15.

Add more citations

References found in this work

Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.

Add more references