On CON(Dominating_lambda > cov_λ(meagre))

Details On CON(Dominating_lambda > cov_λ(meagre)) On CON(Dominating_lambda > cov_λ(meagre))

2009-04-05

arxiv.org/abs/0904.0817v4

Mathematics

Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On CON(Dominating_lambda > cov_λ(meagre)) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On CON(Dominating_lambda > cov_λ(meagre)), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On CON(Dominating_lambda > cov_λ(meagre)) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-132600