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

叶片管理

Leaf management

Jeffry L. Hirst

摘要:

在Weihrauch和逆向数学中,寻找一棵无界树的叶子集合是一个非平凡的过程。尽管如此,树的许多组合原理等价于它们对具有叶集的树的限制。例如,让${\widehat{\sf{WF}}}$表示选择序列中哪些树是良基的问题,让${\sf{PK}}$表示找到树的完满核的问题。令${\widehat{\sf{WF}}}_L$和${\sf{PK}}_L$表示这些原则对具有叶集的树的限制。则${\widehat{\sf{WF}}}$、${\widehat{\sf{WF}}}_L$、${\sf{PK}}$和${\sf{PK}}_L$都等价于${\sf{RCA}_0}$上的${Π^1_1 {\rm -} {\sf{CA}}_0}$,并且都强Weihrauch等价。

英文摘要:

Finding the set of leaves for an unbounded tree is a nontrivial process in both the Weihrauch and reverse mathematics settings. Despite this, many combinatorial principles for trees are equivalent to their restrictions to trees with leaf sets. For example, let ${\widehat{\sf{WF}}}$ denote the problem of choosing which trees in a sequence are well-founded, and let ${\sf{PK}}$ denote the problem of finding the perfect kernel of a tree. Let ${\widehat{\sf{WF}}}_L$ and ${\sf{PK}}_L$ denote the restrictions of these principles to trees with leaf sets. Then ${\widehat{\sf{WF}}}$, ${\widehat{\sf{WF}}}_L$, ${\sf{PK}}$, and ${\sf{PK}}_L$ are all equivalent to ${Π^1_1 {\rm -} {\sf{CA}}_0}$ over ${\sf{RCA}_0}$, and all strongly Weihrauch equivalent.

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

↑