Subcompact cardinals, squares, and stationary reflection

DOI10.1007/S11856-013-0007-XzbMATH Open1291.03100arXiv1106.2490OpenAlexW2083848519WikidataQ61834607 ScholiaQ61834607MaRDI QIDQ375792FDOQ375792

Authors: A. D. Brooke-Taylor, Sy-David Friedman 

Publication date: 31 October 2013

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Abstract: We generalise Jensen's result on the incompatibility of subcompactness with square. We show that alpha^+-subcompactness of some cardinal less than or equal to alpha precludes square_alpha, but also that square may be forced to hold everywhere where this obstruction is not present. The forcing also preserves other strong large cardinals. Similar results are also given for stationary reflection, with a corresponding strengthening of the large cardinal assumption involved. Finally, we refine the analysis by considering Schimmerling's hierarchy of weak squares, showing which cases are precluded by alpha^+-subcompactness, and again we demonstrate the optimality of our results by forcing the strongest possible squares under these restrictions to hold.

Full work available at URL: https://arxiv.org/abs/1106.2490

Recommendations

• Two upper bounds on consistency strength of \(\neg \square_{\aleph_\omega}\) and stationary set reflection at two successive \(\aleph_n\)
• Weak square and stationary reflection
• Square and delta reflection
• A characterization of \(\square(\kappa^{+})\) in extender models
• Square in core models

zbMATH Keywords

forcingsquarestationary reflectionhierarchy of weak squaresstrong large cardinalssubcompactness

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35) Large cardinals (03E55) Continuum hypothesis and Martin's axiom (03E50)

Cites Work

• Squares, scales and stationary reflection
• Iterated forcing and elementary embeddings
• Title not available (Why is that?)
• Elementary Embeddings and Algebra
• Elementary embeddings and infinitary combinatorics
• A very weak square principle
• Title not available (Why is that?)
• Notes on singular cardinal combinatorics
• Large cardinals and gap-1 morasses
• Indestructibility of Vopěnka's principle
• Homogeneous iteration and measure one covering relative to HOD
• Indexed squares
• Combinatorial principles in the core model for one Woodin cardinal
• On the role of supercompact and extendible cardinals in logic
• Large cardinals and definable well-orders on the universe
• CHARACTERIZATION OF □_κ IN CORE MODELS
• An \(L\)-like model containing very large cardinals

Cited In (10)

• On Strong Forms of Reflection in Set Theory
• A quasi-lower bound on the consistency strength of PFA
• Small embedding characterizations for large cardinals
• On the consistency of local and global versions of Chang’s Conjecture
• On strong forms of reflection in set theory
• Title not available (Why is that?)
• Obtaining Woodin’s cardinals
• MORE ON THE PRESERVATION OF LARGE CARDINALS UNDER CLASS FORCING
• Square below a non-weakly compact cardinal
• Title not available (Why is that?)

This page was built for publication: Subcompact cardinals, squares, and stationary reflection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375792)