We develop a new method for coding sets while preserving GCH in the presence of large cardinals, particularly supercompact cardinals. We will use the number of normal measures carried by a measurable cardinal as an oracle, and therefore, in order to code a subset A of κ, we require that our model contain κ many measurable cardinals above κ. Additionally we will describe some of the applications of this result. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

We force a property of cardinals first proved relatively consistent by Sargsyan, that of being supercompact but not equation image-supercompact, starting from a model of set theory which does not satisfy equation image and that contains supercompact cardinals.

We explore Woodin's Universality Theorem and consider to what extent large cardinal properties are transferred into HOD (and other inner models). We also separate the concepts of supercompactness, supercompactness in HOD and being HOD-supercompact. For example, we produce a model where a proper class of supercompact cardinals are not HOD-supercompact but are supercompact in HOD. Additionally we introduce a way to measure the degree of HOD-supercompactness of a supercompact cardinal, and we develop methods to control these degrees simultaneously for a (...) proper class of supercompact cardinals. Finally, we also produce a model in which the unique supercompact cardinal is also the only strongly compact cardinal, no cardinal is supercompact up to an inaccessible cardinal, level by level inequivalence holds and the unique supercompact cardinal is not HOD-supercompact. (shrink)