English

Complicated colorings, revisited

Logic 2022-02-22 v1

Abstract

In a paper from 1997, Shelah asked whether Pr1(λ+,λ+,λ+,λ)Pr_1(\lambda^+,\lambda^+,\lambda^+,\lambda) holds for every inaccessible cardinal λ\lambda. Here, we prove that an affirmative answer follows from (λ+)\square(\lambda^+). Furthermore, we establish that for every pair χ<κ\chi<\kappa of regular uncountable cardinals, (κ)\square(\kappa) implies Pr1(κ,κ,κ,χ)Pr_1(\kappa,\kappa,\kappa,\chi).

Keywords

Cite

@article{arxiv.2202.09902,
  title  = {Complicated colorings, revisited},
  author = {Assaf Rinot and Jing Zhang},
  journal= {arXiv preprint arXiv:2202.09902},
  year   = {2022}
}
R2 v1 2026-06-24T09:46:47.666Z