Laver分划定理的可计算方面
Computable aspects of the Laver partition theorem
AI总结：
该文研究Laver分划定理的反数学与Weihrauch度，明确其证明论强度上下界及相关问题的算术Weihrauch度，为其可计算方面提供精确刻画。
AI中文摘要：
Laver分划定理是分析Laver力迫与Hechler力迫的基础工具，它还与决定性定理、Galvin-Prikry定理相关，可视为这两个定理的共同核心。我们研究限制在开集和闭集上的Laver分划定理的反数学与Weihrauch度，得到该结果证明论强度的上下界，以及与之相关问题的（算术）Weihrauch度的精确图景。
英文摘要：
The Laver Partition Theorem is a fundamental tool in the analysis of Laver and Hechler forcings. It is also connected to determinacy and the Galvin-Prikry theorem: indeed it can be seen as the common core of these two theorems. We study the reverse mathematics and Weihrauch degrees of the Laver Partition Theorem restricted to open and clopen sets. We obtain upper and lower bounds on the proof theoretic strength of this result, as well as a precise picture of the (arithmetical) Weihrauch degrees of the problems related to it.
