The Density of Infima in the Recursively Enumerable Degrees
暂无分享,去创建一个
Abstract We show that every nontrivial interval in the recursively enumerable degrees contains an incomparable pair which have an infimum in the recursively enumerable degrees.
[1] R. Shore. The recursively enumerable α-degrees are dense , 1976 .
[2] A. H. Lachlan. Decomposition of recursively enumerable degrees , 1980 .
[3] R. Soare. Recursively enumerable sets and degrees , 1987 .
[4] Robert I. Soare. Fundamentals of Recursively Enumerable Sets and the Recursion Theorem , 1987 .