2015/09/30 by Marion Scheepers, Scheepers, Marion
Computer Science · Mathematics · Psychology · #54A35 #54D65 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #General Topology (math.GN) #Philosophy and Theoretical Science
paper · pdf · doi:10.48550/arxiv.1509.09296
openalex publication_date 2015/09/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The proof of Theorem 11 of the paper M. Scheepers, Remarks on countable tightness, Topology and its Applications 161 (2014), 407 - 432 relies on Lemma 10 of that paper. The offered proof of Lemma 10 had shortcomings, and I was recently asked for details. This note gives an alternative, complete proof of Lemma 10.