On CON(\mathfrak d_λ> cov_λ(meagre))

2013/02/14 by Saharon Shelah, Shelah, Saharon
Computer Science · Mathematics · #03E17 #03E35 #03E55 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Mathematical and Theoretical Analysis

paper · pdf · doi:10.48550/arxiv.1302.3449

openalex publication_date 2013/02/14 · openalex created_date 2022/08/15 · 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 ^lambdalambda, is strictly bigger than cov_lambda(meagre), i.e. the minimal number of nowhere dense subsets of ^lambda2 needed to cover it. This answers a question of Matet.

Related

• On CON(Dominating_lambda > cov_λ(meagre))
• Dominating numbers at singular cardinals
• Consistency of "the ideal of null restricted to some A is kappa-complete not kappa⁺-complete, kappa weakly inaccessible and cov(meagre)=aleph₁"
• A Lower Bound for Generalized Dominating Numbers
• Small uncountable cardinals in large-scale topology