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 ℵ2 and arrange in the generic extension that simultaneous reflection holds at ℵ2, and at the same time, every stationary subset of ℵ3 concentrating on points of cofinality ω has a reflection point of cofinality ω1. (shrink)

Continuing the work of Fuchs [1], I show that the translation functions developed previously map iterable λ-structures to iterable s-structures and vice versa. To this end, I analyse how the translation functions interact with the formation of extender ultrapowers and normal iterations. This analysis makes it possible to translate iterations, and, in a last step, iteration strategies, thus arriving at the result.

We show in ZFC that if there is no proper class inner model with a Woodin cardinal, then there is an absolutely definablecore modelthat is close toVin various ways.