A criterion for coarse iterability
Skip to main content
eScholarship
Open Access Publications from the University of California

UCLA

UCLA Previously Published Works bannerUCLA

A criterion for coarse iterability

Abstract

The main result of this paper is the following theorem: Let M be a premouse with a top extender, F. Suppose that (a) M is linearly coarsely iterable via hitting F and its images, and (b) if M * is a linear iterate of M as in (a), then M * is coarsely iterable with respect to iteration trees which do not use the top extender of M * and its images. Then M is coarsely iterable.

Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View