On CON(Dominating_lambda > cov_λ(meagre))

2009/04/05 by Saharon Shelah, Shelah, Saharon
Computer Science · Mathematics · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Mathematical and Theoretical Analysis

paper · pdf · doi:10.48550/arxiv.0904.0817

openalex publication_date 2009/04/05 · openalex created_date 2022/09/30 · openalex updated_date 2026/07/28

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.

Related

• On CON(\mathfrak d_λ> cov_λ(meagre))
• A Lower Bound for Generalized Dominating Numbers
• Consistency of "the ideal of null restricted to some A is kappa-complete not kappa⁺-complete, kappa weakly inaccessible and cov(meagre)=aleph₁"
• Dominating numbers at singular cardinals
• Positive partition relations for P_kappa,lambda