Ramsey-like theorems are not computably trivial via a computable coloring forcing DNC computations from avoiding sets, with immunity preservation characterized by pattern shape in reverse mathematics.
The proof-theoretic stre ngth of Ramsey’s theorem for pairs and two colors
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Ramsey-like theorems and immunities
Ramsey-like theorems are not computably trivial via a computable coloring forcing DNC computations from avoiding sets, with immunity preservation characterized by pattern shape in reverse mathematics.