Every problem here was open when it entered the pool.
Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Erdős problem 70 - omega times two four · Conjectures.io
Logic and foundations
Erdős problem 70 - omega times two four
**First open case beyond Erdős–Rado**: c→(ω⋅2,4)23.
Erdős and Rado proved c→(ω+n,4)23 for every finite n≥2
(see erdos_rado), which covers all red ordinals below ω⋅2=ω+ω.
This variant asks whether the result extends to β=ω⋅2, the simplest
countable ordinal not covered by their theorem.
0 α bounty·nobody has started
week of 11 Oct 2025 · nothing publishedweek of 18 Oct 2025 · nothing publishedweek of 25 Oct 2025 · nothing publishedweek of 1 Nov 2025 · nothing publishedweek of 8 Nov 2025 · nothing publishedweek of 15 Nov 2025 · nothing published
Solve it
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
11 Oct 2025nothing published against this one yet3 Oct 2026
erdosproblems.com/70
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.