Determine the provability/unprovability phase transition for the additive-norm finite-well-ordering assertions FWO_N(F) below \varepsilon_0, where FWO_N(F) requires a…
Statement
Determine the provability/unprovability phase transition for the additive-norm finite-well-ordering assertions FWO_N(F) below \varepsilon_0, where FWO_N(F) requires a descending pair in every sufficiently long sequence whose i-th ordinal code has additive norm at most K+F(i).
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.