SCHWEITZER 1971 Problem 2
Prove that there exists an ordered set in which every uncountable subset contains an uncountable, well-ordered subset and that cannot be represented as a union of a countable family of well-ordered subsets.
A. Hajnal
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.