Inductive strength above the bounding lower bound
Determine whether, for all natural numbers n and ell with n >= 1, ell >= 1, and d_{n-1} < ell, the thin set theorem RT_{<infty,ell}^n fails to imply I Sigma_{n+1}^0 over RCA_0; that is, prove or refute RCA_0 not proving RT_{<infty,ell}^n -> I Sigma_{n+1}^0.
References
However, it is not yet known whether this is the optimal lower bound regarding induction. Specifically, the following open question remains:
— Thin set theorem for arbitrarily many colors implies bounding
(2608.25339 - Miyata et al., 26 Aug 2026) in Section ‘Conclusions and future work’, Question; the discussion immediately following the question