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. © The Author(s) 2010.
Author supplied keywords
Cite
CITATION STYLE
APA
Fuchs, G., Neeman, I., & Schindler, R. (2010). A criterion for coarse iterability. Archive for Mathematical Logic, 49(4), 447–467. https://doi.org/10.1007/s00153-010-0180-0
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free