On CON(Dominatinglambda > covλ(meagre))
Abstract
We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambdalambda is strictly bigger than cov(meagrelambda), i.e. the minimal number of nowhere dense subsets of 2lambda needed to cover it. This answers a question of Matet.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.