ON SUPERSETS OF NON-LOW2 SETS

Klaus Ambos-Spies,Rodney G. Downey,Martin Monath

JOURNAL OF SYMBOLIC LOGIC（2021）

引用 0|浏览2

暂无评分

摘要

We solve a longstanding question of Soare by showing that if d is a non-low(2) computably enumerable degree then d contains a c.e. set with no r-maximal c.e. superset.

查看译文

关键词

computably enumerable set, non-low(2), r-maximal

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要