← All problems

No-Least-Join Theorem, Question 1.19

Given a computably enumerable set CC and sets A,B<TCA,B<_T C with A̸≤TBA\not\leq_T B, let a=deg⁡T(A)a=\deg_T(A), b=deg⁡T(B)b=\deg_T(B), and c=deg⁡T(C)c=\deg_T(C). Must there exist a nonzero Turing degree dd such that, for every Turing degree xx, if x≤cx\leq c and b≤a∨xb\leq a\vee x, then d≤xd\leq x?

Equivalent formulations
  1. For a,b,ca,b,c as above, does the collection {x≤c:b≤a∨x}\{x\leq c:b\leq a\vee x\} necessarily have a nonzero common lower bound?

    source: Cone Avoidance and the No-Least-Join Theorem

  2. For a,b,ca,b,c as above, is there necessarily a nonzero Turing cone contained in the collection {x≤c:b≤a∨x}\{x\leq c:b\leq a\vee x\}?

    source: Cone Avoidance and the No-Least-Join Theorem

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

An unrefereed preprint claims to settle the question negatively by strengthening the construction so it avoids any chosen noncomputable cone.

Question 1.191.19 concerns whether a particular structural phenomenon involving joins and lower bounds occurs in the Turing degrees. Patrizio Cintioli’s construction claims a negative answer.

October 1, 2026 cone-avoidance development

Cintioli’s preprint, Cone Avoidance and the No-Least-Join Theorem, claims a no-least-join construction that avoids an arbitrary noncomputable cone, thereby settling the stated question negatively. The result is presented as an unrefereed preprint and is not independently verified here.

Current status (as of October 2026): The question has a claimed negative answer from Cintioli’s preprint, but that claim remains unverified.

Sources

Solutions 0

No solutions have been posted yet.