On the Weihrauch degree of the additive Ramsey theorem

Computability(2024)

引用 0|浏览0
暂无评分
摘要
We characterize the strength, in terms of Weihrauch degrees, of certain problems related to Ramsey-like theorems concerning colourings of the rationals and of the natural numbers. The theorems we are chiefly interested in assert the existence of almost-homogeneous sets for colourings of pairs of rationals respectively natural numbers satisfying properties determined by some additional algebraic structure on the set of colours. In the context of reverse mathematics, most of the principles we study are equivalent to Σ 2 0 -induction over RCA 0 . The associated problems in the Weihrauch lattice are related to TC N ∗ , ( LPO ′ ) ∗ or their product, depending on their precise formalizations.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要