Herrmann'S Beautiful Theorem On Computable Partial Orderings

COMPUTABILITY AND COMPLEXITY: ESSAYS DEDICATED TO RODNEY G. DOWNEY ON THE OCCASION OF HIS 60TH BIRTHDAY（2017）

引用 0|浏览0

暂无评分

摘要

We give an exposition of Herrmann's proof that there is an infinite computable partial ordering with no infinite Sigma(0)(2) chains or antichains.

查看译文

关键词

Computable partial orderings, Chains, Antichains

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要