在狭窄和宽阔的树木中寻找路径
Finding paths through narrow and wide trees
摘要:
我们考虑二阶算术的两个公理。这些公理以两种不同的方式断言,无限但窄的二叉树总是有无限的路径。我们表明,这两个公理是严格弱于弱柯尼希引理,和无与伦比的强度的双重声明(WWKL),广泛的二叉树有路径。
英文摘要:
We consider two axioms of second-order arithmetic. These axioms assert, in two different ways, that infinite but narrow binary trees always have infinite paths. We show that both axioms are strictly weaker than Weak König's Lemma, and incomparable in strength to the dual statement (WWKL) that wide binary trees have paths.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。