Nonuniform computability conjecture for special fan functionals and Pincherle realisers

Let M03M_{0}^{3} be a type-three functional satisfying the Pincherle realiser condition PR(M0)\textup{\textsf{PR}}(M_{0}), and let Θ3\Theta^{3} be a type-three functional satisfying SCF(Θ)\textup{\textsf{SCF}}(\Theta). Computability is in the S1–S9 sense.

Nonuniform computability conjecture. There is an M03M_{0}^{3} satisfying PR(M0)\textup{\textsf{PR}}(M_{0}) such that no Θ3\Theta^{3} satisfying SCF(Θ)\textup{\textsf{SCF}}(\Theta) is computable in M03M_{0}^{3}.

This conjecture captures a proposed fundamental difference between special fan functionals and Pincherle realisers: although the corresponding principles are equivalent in suitable higher-order systems, the functional witnessing the special fan theorem may not be uniformly computable from a Pincherle realiser, even with additional comprehension. The source presents the claim as conjectural and notes that it may be incorrect.

Sources & referencesView supporting material

Primary source

Dag Normann and Sam Sanders, “Pincherle's theorem in Reverse Mathematics and computability theory”, arXiv:1808.09783 (2020).

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.