Small universal families of graphs on $\aleph_{\omega+1}$
Logic
2014-08-20 v1
Abstract
We prove that it is consistent that is strong limit, is large and the universality number for graphs on is small. The proof uses Prikry forcing with interleaved collapsing.
Keywords
Cite
@article{arxiv.1408.4188,
title = {Small universal families of graphs on $\aleph_{\omega+1}$},
author = {James Cummings and Mirna Džamonja and Charles Morgan},
journal= {arXiv preprint arXiv:1408.4188},
year = {2014}
}