On a Conjecture Regarding the Mouse Order for Weasels

Journal of Symbolic Logic:1-27 (forthcoming)
  Copy   BIBTEX

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].

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,583

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

In inner models with Woodin cardinals.Sandra Müller & Grigor Sargsyan - 2021 - Journal of Symbolic Logic 86 (3):871-896.
Initial self-embeddings of models of set theory.Ali Enayat & Zachiri Mckenzie - 2021 - Journal of Symbolic Logic 86 (4):1584-1611.
Some remarks on category of the real line.Kyriakos Keremedis - 1999 - Archive for Mathematical Logic 38 (3):153-162.
Around splitting and reaping for partitions of ω.Hiroaki Minami - 2010 - Archive for Mathematical Logic 49 (4):501-518.
Partitions of large Rado graphs.M. Džamonja, J. A. Larson & W. J. Mitchell - 2009 - Archive for Mathematical Logic 48 (6):579-606.
An example related to Gregory’s Theorem.J. Johnson, J. F. Knight, V. Ocasio & S. VanDenDriessche - 2013 - Archive for Mathematical Logic 52 (3-4):419-434.
Vaught’s conjecture for almost chainable theories.Miloš S. Kurilić - 2021 - Journal of Symbolic Logic 86 (3):991-1005.
Classes of Barren Extensions.Natasha Dobrinen & Dan Hathaway - 2021 - Journal of Symbolic Logic 86 (1):178-209.
Additivity of the two-dimensional Miller ideal.Otmar Spinas & Sonja Thiele - 2010 - Archive for Mathematical Logic 49 (6):617-658.

Analytics

Added to PP
2025-03-18

Downloads
1 (#1,961,382)

6 months
1 (#1,607,365)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Stacking mice.Ronald Jensen, Ernest Schimmerling, Ralf Schindler & John Steel - 2009 - Journal of Symbolic Logic 74 (1):315-335.
Iterability for (transfinite) stacks.Farmer Schlutzenberg - 2021 - Journal of Mathematical Logic 21 (2):2150008.

Add more references