Increasing chains and discrete reflection of cardinality
Santi Spadaro
Abstract
Open-access reader
Santi Spadaro
Abstract
Open-access reader
Combining ideas from two of our previous papers, we refine Arhangel'skii Theorem by proving a cardinal inequality of which this is a special case: any increasing union of strongly discretely Lindelof spaces with countable free sequences and countable pseudocharacter has cardinality at most continuum. We then give a partial positive answer to a problem of Alan Dow on reflection of cardinality by closures of discrete sets.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Combining ideas from two of our previous papers, we refine Arhangel'skii Theorem by proving a cardinal inequality of which this is a special case: any increasing union of strongly discretely Lindelof spaces with countable free sequences and countable pseudocharacter has cardinality at most continuum. We then give a partial positive answer to a problem of Alan Dow on reflection of cardinality by closures of discrete sets.
Key concepts: Cardinality (data modeling), Reflection (computer programming), Mathematics, Computer science, Data mining, Programming language