Strong colorings over partitions
Logic
2023-06-22 v2
Abstract
A strong coloring on a cardinal is a function such that for every of full size , every color is attained by . The symbol asserts the existence of a strong coloring on . We introduce the symbol which asserts the existence of a coloring which is strong over a partition . A coloring is strong over if for every there is so that every color is attained by . We prove that whenever holds, also holds for an arbitrary finite partition . Similarly, arbitrary finite -s can be added to stronger symbols which hold in any model of ZFC. If , then and stronger symbols, like or , hold also for an arbitrary partition to parts.
Cite
@article{arxiv.2002.06705,
title = {Strong colorings over partitions},
author = {William Chen-Mertens and Menachem Kojman and Juris Steprans},
journal= {arXiv preprint arXiv:2002.06705},
year = {2023}
}
Comments
Version accepted for publication in the Bulletin of Symbolic Logic