A framework for forcing constructions at successors of singular cardinals
James Cummings, Mirna Džamonja, Menachem Magidor, Charles G. Morgan, Saharon Shelah
Abstract
Open-access reader
James Cummings, Mirna Džamonja, Menachem Magidor, Charles G. Morgan, Saharon Shelah
Abstract
Open-access reader
We describe a framework for proving consistency results about singular cardinals of arbitrary cofinality and their successors. This framework allows the construction of models in which the Singular Cardinals Hypothesis fails at a singular cardinal κ \kappa of uncountable cofinality, while κ + \kappa ^+ enjoys various combinatorial properties. As a sample application, we prove the consistency (relative to that of ZFC plus a supercompact cardinal) of there being a strong limit singular cardinal κ \kappa of uncountable cofinality where SCH fails and such that there is a collection of size less than 2 κ + 2^{\kappa ^+} of graphs on κ + \kappa ^+ such that any graph on κ + \kappa ^+ embeds into one of the graphs in the collection.
OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We describe a framework for proving consistency results about singular cardinals of arbitrary cofinality and their successors. This framework allows the construction of models in which the Singular Cardinals Hypothesis fails at a singular cardinal κ \kappa of uncountable cofinality, while κ + \kappa ^+ enjoys various combinatorial properties. As a sample application, we prove the consistency (relative to that of ZFC plus a supercompact cardinal) of there being a strong limit singular cardinal κ \kappa of uncountable cofinality where SCH fails and such that there is a collection of size less than 2 κ + 2^{\kappa ^+} of graphs on κ + \kappa ^+ such that any graph on κ + \kappa ^+ embeds into one of the graphs in the collection.
Key concepts: Uncountable set, Algorithm, Cofinality, Type (biology), Annotation, Computer science, Mathematics, Consistency (knowledge bases)