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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.