ProbXiv
Explorersign in
Problem archiveProblem record

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.