Hostname: page-component-6766d58669-kn6lq Total loading time: 0 Render date: 2026-05-18T22:15:58.576Z Has data issue: false hasContentIssue false

ON A CONJECTURE REGARDING THE MOUSE ORDER FOR WEASELS

Published online by Cambridge University Press:  17 March 2025

JAN KRUSCHEWSKI*
Affiliation:
INSTITUT FÜR DISKRETE MATHEMATIK UND GEOMETRIE TECHNISCHE UNIVERSITÄT WIEN WIEDNER HAUPTSTRASSE 8-10/104 1040 WIEN, AUSTRIA E-mail: jan.kruschewski@tuwien.ac.at
FARMER SCHLUTZENBERG
Affiliation:
INSTITUT FÜR DISKRETE MATHEMATIK UND GEOMETRIE TECHNISCHE UNIVERSITÄT WIEN WIEDNER HAUPTSTRASSE 8-10/104 1040 WIEN, AUSTRIA E-mail: jan.kruschewski@tuwien.ac.at
Rights & Permissions [Opens in a new window]

Abstract

We investigate Steel’s conjecture in ‘The Core Model IterabilityProblem’ [10], that if $\mathcal {W}$ and $\mathcal {R}$ are $\Omega +1$-iterable, $1$-small weasels, then $\mathcal {W}\leq ^{*}\mathcal {R}$ iff there is a club $C\subset \Omega $ such that for all $\alpha \in C$, if $\alpha $ is regular, then $\alpha ^{+\mathcal {W}}\leq \alpha ^{+\mathcal {R}}$. We will show that the conjecture fails, assuming that thereis an iterable premouse M which models KP and which has a-Woodin cardinal. On the other hand, we show thatassuming there is no transitive model of KP with a Woodin cardinal theconjecture holds. In the course of this we will also show that ifM is a premouse which models KP with a largest, regular,uncountable cardinal $\delta $, and $\mathbb {P} \in M$ is a forcing poset such that $M\models "\mathbb {P}\text { has the }\delta \text {-c.c.}"$, and $g\subset \mathbb {P}$ is M-generic, then $M[g]\models \text {KP}$. Additionally, we study the preservation of admissibilityunder iteration maps. At last, we will prove a fact about the closure of the setof ordinals at which a weasel has the S-hull property. Thisanswers another question implicit in remarks in [10].

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of The Association for Symbolic Logic