We give modest upper bounds for consistency strengths for two well-studied combinatorial principles. These bounds range at the level of subcompact cardinals, which is significantly below a -supercompact cardinal. All previously known upper bounds on these principles ranged at the level of some degree of supercompactness. We show that by using any of the standard modified Prikry forcings it is possible to turn a measurable subcompact cardinal into and make the principle fail in the generic extension. We also show that by using Lévy collapse followed by standard iterated club shooting it is possible to turn a subcompact cardinal into and arrange in the generic extension that simultaneous reflection holds at , and at the same time, every stationary subset of concentrating on points of cofinality has a reflection point of cofinality .
Martin Zeman. "Two Upper Bounds on Consistency Strength of and Stationary Set Reflection at Two Successive ." Notre Dame J. Formal Logic 58 (3) 409 - 432, 2017. https://doi.org/10.1215/00294527-2017-0005