Indestructibility and the linearity of the Mitchell ordering

Archive for Mathematical Logic 63 (3):473-482 (2024)
  Copy   BIBTEX

Abstract

Suppose that κ\kappa is indestructibly supercompact and there is a measurable cardinal λ>κ\lambda > \kappa . It then follows that \(A_0 = \{\delta is a measurable cardinal and the Mitchell ordering of normal measures over \(\delta \) is nonlinear }\} is unbounded in κ\kappa . If the Mitchell ordering of normal measures over λ\lambda is also linear, then by reflection (and without any use of indestructibility), \(A_1= \{\delta is a measurable cardinal and the Mitchell ordering of normal measures over \(\delta \) is linear }\} is unbounded in κ\kappa as well. The large cardinal hypothesis on λ\lambda is necessary. We demonstrate this by constructing via forcing two models in which κ\kappa is supercompact and κ\kappa exhibits an indestructibility property slightly weaker than full indestructibility but sufficient to infer that A0A_0 is unbounded in κ\kappa if λ>κ\lambda > \kappa is measurable. In one of these models, for every measurable cardinal δ\delta , the Mitchell ordering of normal measures over δ\delta is linear. In the other of these models, for every measurable cardinal δ\delta , the Mitchell ordering of normal measures over δ\delta is nonlinear.

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: 105,289

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

Analytics

Added to PP
2024-02-15

Downloads
34 (#739,458)

6 months
15 (#212,202)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The lottery preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
Sets constructible from sequences of ultrafilters.William J. Mitchell - 1974 - Journal of Symbolic Logic 39 (1):57-66.

View all 14 references / Add more references