Skip to main content
    • Aa
    • Aa

A minimal pair of recursively enumerable degrees

  • C. E. M. Yates (a1)

Our principal result is that there exist two incomparable recursively enumerable degrees whose greatest lower bound in the upper semilattice of degrees is 0. This was conjectured by Sacks [5]. As a secondary result, we prove that on the other hand there exists a recursively enumerable degree a < 0(1) such that for no non-zero recursively enumerable degree b is 0 the greatest lower bound of a and b.

The proof of the main theorem involves a method that we have developed elsewhere [8] to deal with situations in which a partial recursive functional may interfere infinitely often with an opposed requirement of lower priority.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[1] R. M. Friedberg , Two recursively enumerable sets of incomparable degrees of unsolvability, Proceedings of National Academy of Science, U.S.A., vol. 43 (1957), pp. 236238.

[4] E. L. Post , Recursively enumerable sets of positive integers and their decision-problems, Bulletin of the American Mathematical Society, vol. 50 (1944), pp. 284316.

[6] G. E. Sacks , The recursively enumerable degrees are dense, Annals of Mathematics, vol. 80 (1964), pp. 300312.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 2 *
Loading metrics...

Abstract views

Total abstract views: 80 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 26th May 2017. This data will be updated every 24 hours.