Generalizations of Free Set, Thin Set, and Rainbow Ramsey theorems are proved for the Schreier barrier, with computability analysis showing that the first two can code ∅^(ω) while the third does not code 0'.
Sur une caract´ erisation des alephs.Fund
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Ramsey-like theorems for the Schreier barrier
Generalizations of Free Set, Thin Set, and Rainbow Ramsey theorems are proved for the Schreier barrier, with computability analysis showing that the first two can code ∅^(ω) while the third does not code 0'.