Abstract
We give a combinatorial characterization of countable submaximal subspaces of 2κ. Using a parametrized version of Mathias forcing, we prove that there exists a countable submaximal subspace of 2ω1 whilst c=ω2. Combining this with previous results, we construct a disjointly tight countable irresolvable space of weight <c, answering a question of Bella and Hrušák.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
