2002/12/02 by Wiesław Kubiś, Wieslaw Kubís, Saharon Shelah +2
Computer Science · Mathematics · #Computational Drug Discovery Methods #FOS: Mathematics #Logic (math.LO) #math.LO
paper · pdf · doi:10.48550/arxiv.math/0212026
published as Ann. Pure Appl. Logic 121 No. 2-3 (2003) 145--161
arxiv created 2002/12/02 · openalex publication_date 2002/12/02 · arxiv updated 2009/11/30 · openalex created_date 2024/04/11 · openalex updated_date 2026/07/28
We investigate the existence of perfect homogeneous sets for analytic colorings. An analytic coloring of X is an analytic subset of [X]N, where N>1 is a natural number. We define an absolute rank function on trees representing analytic colorings, which gives an upper bound for possible cardinalities of homogeneous sets and which decides whether there exists a perfect homogeneous set. We construct universal sigma-compact colorings of any prescribed rank gamma