Abstract
AbstractWe show that every sufficiently iterable countable mouse has a unique iteration strategy whose associated iteration maps are lexicographically minimal. This enables us to extend the results of [3] on the good behavior of the standard parameter from tame mice to arbitrary mice.
Publisher
Cambridge University Press (CUP)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Comparison Process for Mouse Pairs;LECT NOTES LOGIC;2022-11-10
2. Iterability for (transfinite) stacks;Journal of Mathematical Logic;2021-04-26
3. Equiconsistencies at subcompact cardinals;Archive for Mathematical Logic;2015-12-22
4. Inner Models for Large Cardinals;Handbook of the History of Logic;2012
5. An Outline of Inner Model Theory;Handbook of Set Theory;2009-12-10