Complicated colorings, revisited

Joint work with Jing Zhang.

Abstract. In a paper from 1997, Shelah asked whether Pr1(λ+,λ+,λ+,λ) 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 Pr1(κ,κ,κ,χ).

 

Downloads:

[No related presentations]

 

This entry was posted in Partition Relations and tagged , . Bookmark the permalink.

One Response to Complicated colorings, revisited

  1. saf says:

    Submitted to Annals of Pure and Applied Logic, February 2022.
    Accepted, December 2022.

Comments are closed.