Small universal families of graphs on aleph_(ω+1)
classification
🧮 math.LO
keywords
alephomegagraphssmallcollapsingconsistentfamiliesforcing
read the original abstract
We prove that it is consistent that $\aleph_\omega$ is strong limit, $2^{\aleph_\omega}$ is large and the universality number for graphs on $\aleph_{\omega+1}$ is small. The proof uses Prikry forcing with interleaved collapsing.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.