期刊
JOURNAL OF SYMBOLIC LOGIC
卷 66, 期 2, 页码 923-934出版社
ASSN SYMBOLIC LOGIC INC
DOI: 10.2307/2695053
关键词
-
类别
We show that every infinite computable partial ordering has either an infinite Delta (0)(2) chain or an infinite Pi (0)(2) antichain. Our main result is that this cannot be improved: We construct an infinite computable partial ordering that has neither an infinite Delta (0)(2) chain nor an infinite Delta (0)(2) antichain.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据