Nonreducibility conjectures for cohesive and stable Ramsey principles
Nonreducibility conjectures for cohesive and stable Ramsey principles
Let denote the cohesive principle, let denote the indicated indivisibility problem for -colorings, and let denote the relevant computable reducibility. Write for the set of natural numbers. Nonreducibility conjecture.
and
or, at least,
The conjecture concerns the open separation of the indivisibility principles from cohesive and stable Ramsey principles under computable reducibility; the source presents these nonreducibilities as conjectural after noting that the corresponding reducibility questions are open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Kenneth Gill, “Indivisibility and uniform computational strength”, arXiv:2312.03919 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.