Key points are not available for this paper at this time.
Abstract We prove that it is consistent that _ is strong limit, 2^ _ is large and the universality number for graphs on + ₁ is small. The proof uses Prikry forcing with interleaved collapsing.
Building similarity graph...
Analyzing shared references across papers
Loading...
James Cummings
Carnegie Mellon University
Mirna Džamonja
Rutgers, The State University of New Jersey
Charles G. Morgan
Eötvös Loránd University
Journal of Symbolic Logic
University College London
Carnegie Mellon University
University of East Anglia
Building similarity graph...
Analyzing shared references across papers
Loading...
Cummings et al. (Wed,) studied this question.
synapsesocial.com/papers/6a155665cb0379474a8223d8 — DOI: https://doi.org/10.1017/jsl.2015.65