2022/09/16 by Nedeljko Stefanović, Stefanović, Nedeljko
Mathematics · #03E35 #03E75 #05A18 #05D10 #Advanced Topology and Set Theory #FOS: Mathematics #Logic (math.LO)
paper · pdf · doi:10.48550/arxiv.2209.07768
openalex publication_date 2022/09/16 · openalex created_date 2022/09/20 · openalex updated_date 2026/07/28
In arXiv:2209.04859 Andy Zucker and Chris Lambie-Hanson proved the consistency result for some coloring principle for the products of polish spaces by at most countable many colors. This principle easy implies Halpern and Läuchli's theorem. The aim of this paper is to generaliza this consistency result to sets of colors of cardinality less than 2ℵ0. The proof presented here differs than the proof presented in arXiv:2209.04859.