2015•arXiv (Cornell University)Open access

Increasing chains and discrete reflection of cardinality

Santi Spadaro

Open full text 0 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Increasing chains and discrete reflection of cardinality — Research Paper | ScholarLens