It is shown that any nonzero recursively enumerable degree can be expressed as the join of two distinct such degrees having a greatest lower bound. Journal Information This monthly journal, begun in ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback