ON A CONJECTURE REGARDING THE MOUSE ORDER FOR WEASELS

Abstract We investigate Steel’s conjecture in ‘The Core Model Iterability Problem’ [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 there is an iterable premouse M which models KP and which has a -Woodin cardinal. On the other hand, we show that assuming there is no transitive model of KP with a Woodin cardinal the conjecture holds. In the course of this we will also show that if M 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 admissibility under iteration maps. At last, we will prove a fact about the closure of the set of ordinals at which a weasel has the S -hull property. This answers another question implicit in remarks in [10].

Authors

Institutions

Publication Details

Journal
Journal of Symbolic Logic
Published
2025-03-01
DOI
https://doi.org/10.1017/jsl.2024.63
Citations
1
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
1.50
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ON A CONJECTURE REGARDING THE MOUSE ORDER FOR WEASELS

Farmer Schlutzenberg, Jan Kruschewski
1 citations
Journal of Symbolic Logic
Computability, Logic, AI Algorithms
1.50
article

ON A CONJECTURE REGARDING THE MOUSE ORDER FOR WEASELS

Farmer Schlutzenberg, Jan Kruschewski
article en
1 citations

Abstract

Abstract We investigate Steel’s conjecture in ‘The Core Model Iterability Problem’ [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 there is an iterable premouse M which models KP and which has a -Woodin cardinal. On the other hand, we show that assuming there is no transitive model of KP with a Woodin cardinal the conjecture holds. In the course of this we will also show that if M 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 admissibility under iteration maps. At last, we will prove a fact about the closure of the set of ordinals at which a weasel has the S -hull property. This answers another question implicit in remarks in [10].

Journal of Symbolic LogicVol. 90(1)
University of Applied Sciences Technikum Wien (AT), TU Wien (AT)
Openalex Percentile: Top 19%
Computability, Logic, AI Algorithms
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

ON A CONJECTURE REGARDING THE MOUSE ORDER FOR WEASELS — Farmer Schlutzenberg, Jan Kruschewski · Journal of Symbolic Logic (2025) | TGRS Research Map | TGRS