The lower-bounds sharpening conjecture

About 10 years old · traced to

Suppose TT is a theory containing IΣ1\mathrm{I}\Sigma_1, (c,i)↦lc(i)(c,i)\mapsto l_c(i) is nondecreasing, and MfM_f is a computable function for every computable ff, satisfying:

  1. T⊬∀x ∃y Mlc−1(x)=yT \nvdash \forall x\,\exists y\,M_{l_c^{-1}}(x)=y for every cc.
  2. If f(i)≤g(i)f(i)\leq g(i) for all i≤Mg(x)i\leq M_g(x), then Mf(x)≤Mg(x)M_f(x)\leq M_g(x).
  3. HH eventually dominates every function provably total in TT.

Lower-bounds sharpening conjecture. Then

T⊬∀x ∃y Mh(x)=y,T \nvdash \forall x\,\exists y\,M_h(x)=y,

where

h(i)=lH−1(i)−1(i).h(i)=l_{H^{-1}(i)}^{-1}(i).

The conjecture seeks to make the lower-bound sharpening argument independent of the particular method used to prove independence of the corresponding identity-parameter statement. Its status is unclear from the supplied text.

References

Primary source

Florian Pelupessy, “Phase transition results for three Ramsey-like theorems”, arXiv:1603.06695 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.