Complicated colorings, revisited
Logic
2022-02-22 v1
Abstract
In a paper from 1997, Shelah asked whether holds for every inaccessible cardinal . Here, we prove that an affirmative answer follows from . Furthermore, we establish that for every pair of regular uncountable cardinals, implies .
Keywords
Cite
@article{arxiv.2202.09902,
title = {Complicated colorings, revisited},
author = {Assaf Rinot and Jing Zhang},
journal= {arXiv preprint arXiv:2202.09902},
year = {2022}
}