ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let φ\varphi be an untranscendable linear order. A linear order is strongly indecomposable when [the source context does not provide a definition]. An uncountable real type is the order type of an uncountable subset of R\mathbb{R}. The Trichotomy Conjecture. For every untranscendable linear order φ\varphi, at least one of the following holds: φ\varphi is strongly indecomposable, φ\varphi contains an uncountable real type, or φ=2\varphi=2. This conjecture asks whether uncountable real types, together with the exceptional type 22, account for all untranscendable orders that are not strongly indecomposable; the source presents it as an open problem, possibly assuming PFA\mathsf{PFA} as indicated by its name.

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.