Using Ramsey’s theorem once

Archive for Mathematical Logic(2019)

引用 8|浏览1
暂无评分
摘要
We show that 𝖱𝖳 (2,4) cannot be proved with one typical application of 𝖱𝖳 (2,2) in an intuitionistic extension of 𝖱𝖢𝖠_0 to higher types, but that this does not remain true when the law of the excluded middle is added. The argument uses Kohlenbach’s axiomatization of higher order reverse mathematics, results related to modified reducibility, and a formalization of Weihrauch reducibility.
更多
查看译文
关键词
Ramsey,Weihrauch,Uniform reduction,Higher order,Reverse mathematics,Proof mining
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要