Loading [MathJax]/jax/output/CommonHTML/jax.js
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    Iterability for (transfinite) stacks

    We establish natural criteria under which normally iterable premice are iterable for stacks of normal trees. Let Ω be a regular uncountable cardinal. Let m<ω and M be an m-sound premouse and Σ be an (m,Ω+1)-iteration strategy for M (roughly, a normal (Ω+1)-strategy). We define a natural condensation property for iteration strategies, inflation condensation. We show that if Σ has inflation condensation then M is (m,Ω,Ω+1)-iterable (roughly, M is iterable for length Ω stacks of normal trees each of length <Ω), and moreover, we define a specific such strategy Σst and a reduction of stacks via Σst to normal trees via Σ. If Σ has the Dodd-Jensen property and card(M)<Ω then Σ has inflation condensation. We also apply some of the techniques developed to prove that if Σ has strong hull condensation (introduced independently by John Steel), and G is V-generic for an Ω-cc forcing, then Σ extends to an (m,Ω+1)-strategy Σ+ for M with strong hull condensation, in the sense of V[G]. Moreover, this extension is unique. We deduce that if G is V-generic for a ccc forcing then V and V[G] have the same ω-sound, (ω,Ω+1)-iterable premice which project to ω.