arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.03325math.LO
收藏

Dickson引理的一个界

A bound for Dickson's lemma

Josef Berger, Helmut Schwichtenberg

摘要:

我们考虑Dickson引理的一个特殊情况:对于自然数上的任意两个函数$f,g$,存在两个数$i<j$,使得$f$和$g$在它们上都弱增加,即,$f_i\le f_j$和$g_i \le g_j$。通过一个组合的参数(由于第一作者)的一个简单的界这样的$i,j$的构造。组合学是基于有限鸽子洞原理,并在下降引理的结果。从下降引理可以证明迪克森引理,然后猜测可能的界限,并通过适当的证明来验证它。我们还提取(通过可实现性)的约束(形式化)我们的下降引理的证明。关键词:迪克森引理,有限鸽子洞原理,从证明中提取程序,非计算量词。

英文摘要:

We consider a special case of Dickson's lemma: for any two functions $f,g$ on the natural numbers there are two numbers $i<j$ such that both $f$ and $g$ weakly increase on them, i.e., $f_i\le f_j$ and $g_i \le g_j$. By a combinatorial argument (due to the first author) a simple bound for such $i,j$ is constructed. The combinatorics is based on the finite pigeon hole principle and results in a descent lemma. From the descent lemma one can prove Dickson's lemma, then guess what the bound might be, and verify it by an appropriate proof. We also extract (via realizability) a bound from (a formalization of) our proof of the descent lemma. Keywords: Dickson's lemma, finite pigeon hole principle, program extraction from proofs, non-computational quantifiers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑