zbMATH — the first resource for mathematics

Square in core models. (English) Zbl 0992.03062
Summary: We prove that in all Mitchell-Steel core models, \(\square_\kappa\) holds for all \(\kappa\). From this we obtain new consistency strength lower bounds for the failure of \(\square_\kappa\) if \(\kappa\) is either singular and countably closed, weakly compact, or measurable. Jensen introduced a large cardinal property that we call subcompactness; it lies between superstrength and supercompactness in the large cardinal hierarchy. We prove that in all Jensen core models, \(\square_\kappa\) holds if \(\kappa\) is not subcompact. (See Theorem 15; the only-if direction is essentially due to Jensen).

03E45 Inner models, including constructibility, ordinal definability, and core models
03E55 Large cardinals
Full Text: DOI Link
[1] The Journal of Symbolic Logic
[2] DOI: 10.1016/0003-4843(78)90031-1 · Zbl 0376.02055
[3] DOI: 10.1016/S0168-0072(99)00020-2 · Zbl 0941.03054
[4] DOI: 10.1016/0003-4843(72)90001-0 · Zbl 0257.02035
[5] Journal of Mathematical Logic
[6] DOI: 10.1090/S0002-9939-1995-1257099-0
[7] Israel Journal of Mathematics
[8] DOI: 10.2307/2586620 · Zbl 0948.03043
[9] Sets and proofs
[10] Set theory, techniques and applications, Curacao 1995 and Barcelona 1996 conferences pp 207– (1998)
[11] DOI: 10.1016/0168-0072(94)00036-3 · Zbl 0834.03018
[12] The Journal of Symbolic Logic
[13] Lecture notes in logic 3 (1994)
[14] Annals of Pure and AppliedLogic 84 pp 219– (1997)
[15] DOI: 10.4310/MRL.1995.v2.n5.a6 · Zbl 0847.03024
[16] DOI: 10.1073/pnas.85.18.6582 · Zbl 0656.03036
[17] Logic and its applications 1 (1999)
[18] Lecture notes in logic 8 (1996)
[19] Handbook of set theory
[20] DOI: 10.1090/S0002-9947-99-02411-3 · Zbl 0928.03059
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.