2006/05/02 by Chris Good, Good, Chris, Lylah Haynes +1
Computer Science · Mathematics · #54E20 #54E30 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #General Topology (math.GN) #Rings, Modules, and Algebras #math.GN #msc:54E20 #msc:54E30
paper · pdf · doi:10.48550/arxiv.math/0605072
11 pages
arxiv created 2006/05/02 · openalex publication_date 2006/05/02 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
One possible natural monotone version of countable paracompactness, MCP, turns out to have some interesting properties. We investigate various other possible monotonizations of countable paracompactness and how they are related.