The lower-bounds sharpening conjecture
The lower-bounds sharpening conjecture
Suppose is a theory containing , is nondecreasing, and is a computable function for every computable , satisfying:
- for every .
- If for all , then .
- eventually dominates every function provably total in .
Lower-bounds sharpening conjecture. Then
where
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.
Sources & referencesView supporting material
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
Sign in to submit a solution.
No solutions have been posted yet.