RAMSEY THEORY OVER PARTITIONS III: STRONGLY LUZIN SETS AND PARTITION RELATIONS

Menachem Kojman, Assaf Rinot, Juris Steprāns

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

The strongest type of coloring of pairs of countable ordinals, gotten by Todorčević from a strongly Luzin set, is shown to be equivalent to the existence of a nonmeager set of reals of size ℵ1. In the other direction, it is shown that the existence of both a strongly Luzin set and a coherent Souslin tree is compatible with the existence of a countable partition of pairs of countable ordinals such that no coloring is strong over it. This clarifies the interaction between a gallery of coloring assertions going back to Luzin and Sierpi´ nski a hundred years ago.

Original languageEnglish
Pages (from-to)369-384
Number of pages16
JournalProceedings of the American Mathematical Society
Volume151
Issue number1
DOIs
StatePublished - 1 Jan 2023

ASJC Scopus subject areas

  • General Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'RAMSEY THEORY OVER PARTITIONS III: STRONGLY LUZIN SETS AND PARTITION RELATIONS'. Together they form a unique fingerprint.

Cite this