Building iteration trees

Journal of Symbolic Logic 56 (4):1369-1384 (1991)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275481
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,188
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
On the Consistency of the Definable Tree Property on ℵ.Amir Leshem - 2000 - Journal of Symbolic Logic 65 (3):1204 - 1214.
Trees and Diagrams of Decomposition.Anita Wasilewska - 1985 - Studia Logica 44 (2):139 - 158.
Canonical Seeds and Prikry Trees.Joel David Hamkins - 1997 - Journal of Symbolic Logic 62 (2):373-396.
An Smax Variation for One Souslin Tree.Paul Larson - 1999 - Journal of Symbolic Logic 64 (1):81 - 98.
Iterates of the Core Model.Ralf Schindler - 2006 - Journal of Symbolic Logic 71 (1):241 - 251.

Monthly downloads

Added to index

2009-01-28

Total downloads

7 ( #516,941 of 2,153,860 )

Recent downloads (6 months)

1 ( #398,005 of 2,153,860 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums