On CON(Dominating_lambda > cov_\lambda(meagre))
Logic
2022-09-07 v7
Abstract
We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of 2^lambda needed to cover it. This answers a question of Matet.
Keywords
Cite
@article{arxiv.0904.0817,
title = {On CON(Dominating_lambda > cov_\lambda(meagre))},
author = {Saharon Shelah},
journal= {arXiv preprint arXiv:0904.0817},
year = {2022}
}