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 \(A_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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

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

Erratum: “Forcing and antifoundation”. [REVIEW]Athanassios Tzouvaras - 2005 - Archive for Mathematical Logic 44 (5):663-663.
Well-foundedness in Realizability.M. Hofmann, J. van Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.
Well-foundedness in Realizability.M. Hofmann, J. Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.
Preface.Douglas Cenzer & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):529-531.
Computability in Europe 2008.Arnold Beckmann, Costas Dimitracopoulos & Benedikt Löwe - 2010 - Archive for Mathematical Logic 49 (2):119-121.
Preface.Douglas Cenzer, Valentina Harizanov, David Marker & Carol Wood - 2009 - Archive for Mathematical Logic 48 (1):1-6.
A note on the schemes of replacement and collection.A. R. D. Mathias - 2007 - Archive for Mathematical Logic 46 (1):43-50.
Partitions of trees and $${{\sf ACA}^\prime_{0}}$$.Bernard A. Anderson & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (3-4):227-230.
Overspill and fragments of arithmetic.C. Dimitracopoulos - 1989 - Archive for Mathematical Logic 28 (3):173-179.
Professor Dr. Hans Hermes.[author unknown] - 2004 - Archive for Mathematical Logic 43 (4):425-425.
On locally modular, weakly minimal theories.James Loveys - 1993 - Archive for Mathematical Logic 32 (3):173-194.
Diamond principles in Cichoń’s diagram.Hiroaki Minami - 2005 - Archive for Mathematical Logic 44 (4):513-526.

Analytics

Added to PP
2024-02-15

Downloads
9 (#1,258,729)

6 months
9 (#317,143)

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